TSTP Solution File: SWV397+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV397+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 22:32:51 EDT 2023
% Result : Theorem 0.48s 1.18s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 33 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 3 |; 4 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 44 ( 4 sgn; 28 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).
fof(f31,axiom,
! [X0,X1,X2,X3] :
( ~ contains_slb(X1,X3)
=> triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax43) ).
fof(f42,conjecture,
! [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l33_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
=> contains_slb(X1,X3) ),
inference(negated_conjecture,[],[f42]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f70,plain,
! [X0,X1,X2,X3] :
( triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f31]) ).
fof(f82,plain,
? [X0,X1,X2,X3] :
( ~ contains_slb(X1,X3)
& ok(remove_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
( ? [X0,X1,X2,X3] :
( ~ contains_slb(X1,X3)
& ok(remove_cpq(triple(X0,X1,X2),X3)) )
=> ( ~ contains_slb(sK1,sK3)
& ok(remove_cpq(triple(sK0,sK1,sK2),sK3)) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
( ~ contains_slb(sK1,sK3)
& ok(remove_cpq(triple(sK0,sK1,sK2),sK3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f82,f89]) ).
fof(f125,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f128,plain,
! [X2,X3,X0,X1] :
( triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f70]) ).
fof(f139,plain,
ok(remove_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f90]) ).
fof(f140,plain,
~ contains_slb(sK1,sK3),
inference(cnf_transformation,[],[f90]) ).
cnf(c_83,plain,
~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f125]) ).
cnf(c_86,plain,
( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_95,negated_conjecture,
~ contains_slb(sK1,sK3),
inference(cnf_transformation,[],[f140]) ).
cnf(c_96,negated_conjecture,
ok(remove_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f139]) ).
cnf(c_1668,plain,
remove_cpq(triple(X0,sK1,X1),sK3) = triple(X0,sK1,bad),
inference(superposition,[status(thm)],[c_86,c_95]) ).
cnf(c_1672,plain,
ok(triple(sK0,sK1,bad)),
inference(demodulation,[status(thm)],[c_96,c_1668]) ).
cnf(c_1673,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1672,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV397+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 08:21:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.18 % SZS status Started for theBenchmark.p
% 0.48/1.18 % SZS status Theorem for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.18
% 0.48/1.18 ------ iProver source info
% 0.48/1.18
% 0.48/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.18 git: non_committed_changes: false
% 0.48/1.18 git: last_make_outside_of_git: false
% 0.48/1.18
% 0.48/1.18 ------ Parsing...
% 0.48/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.18 ------ Proving...
% 0.48/1.18 ------ Problem Properties
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 clauses 41
% 0.48/1.18 conjectures 2
% 0.48/1.18 EPR 7
% 0.48/1.18 Horn 27
% 0.48/1.18 unary 17
% 0.48/1.18 binary 12
% 0.48/1.18 lits 78
% 0.48/1.18 lits eq 28
% 0.48/1.18 fd_pure 0
% 0.48/1.18 fd_pseudo 0
% 0.48/1.18 fd_cond 5
% 0.48/1.18 fd_pseudo_cond 5
% 0.48/1.18 AC symbols 0
% 0.48/1.18
% 0.48/1.18 ------ Schedule dynamic 5 is on
% 0.48/1.18
% 0.48/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 ------
% 0.48/1.18 Current options:
% 0.48/1.18 ------
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 ------ Proving...
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 % SZS status Theorem for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.18
% 0.48/1.18
%------------------------------------------------------------------------------