TSTP Solution File: SWB002+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWB002+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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 20:08:56 EDT 2023
% Result : Theorem 13.77s 2.69s
% Output : CNFRefutation 13.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 3 |; 8 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn; 4 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f559,conjecture,
? [X41,X42] :
( iext(uri_ex_q,X42,X41)
& iext(uri_ex_p,X41,X42) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(f560,negated_conjecture,
~ ? [X41,X42] :
( iext(uri_ex_q,X42,X41)
& iext(uri_ex_p,X41,X42) ),
inference(negated_conjecture,[],[f559]) ).
fof(f561,axiom,
? [X43] :
( iext(uri_ex_q,X43,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X43) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f920,plain,
~ ? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
inference(rectify,[],[f560]) ).
fof(f921,plain,
? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) ),
inference(rectify,[],[f561]) ).
fof(f1330,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(ennf_transformation,[],[f920]) ).
fof(f1921,plain,
( ? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) )
=> ( iext(uri_ex_q,sK251,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK251) ) ),
introduced(choice_axiom,[]) ).
fof(f1922,plain,
( iext(uri_ex_q,sK251,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK251) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK251])],[f921,f1921]) ).
fof(f3212,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f1330]) ).
fof(f3213,plain,
iext(uri_ex_p,uri_ex_s,sK251),
inference(cnf_transformation,[],[f1922]) ).
fof(f3214,plain,
iext(uri_ex_q,sK251,uri_ex_s),
inference(cnf_transformation,[],[f1922]) ).
cnf(c_1326,negated_conjecture,
( ~ iext(uri_ex_q,X0,X1)
| ~ iext(uri_ex_p,X1,X0) ),
inference(cnf_transformation,[],[f3212]) ).
cnf(c_1327,plain,
iext(uri_ex_q,sK251,uri_ex_s),
inference(cnf_transformation,[],[f3214]) ).
cnf(c_1328,plain,
iext(uri_ex_p,uri_ex_s,sK251),
inference(cnf_transformation,[],[f3213]) ).
cnf(c_59967,plain,
~ iext(uri_ex_p,uri_ex_s,sK251),
inference(superposition,[status(thm)],[c_1327,c_1326]) ).
cnf(c_59968,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1328,c_59967]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB002+1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Aug 27 06:26:33 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 13.77/2.69 % SZS status Started for theBenchmark.p
% 13.77/2.69 % SZS status Theorem for theBenchmark.p
% 13.77/2.69
% 13.77/2.69 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 13.77/2.69
% 13.77/2.69 ------ iProver source info
% 13.77/2.69
% 13.77/2.69 git: date: 2023-05-31 18:12:56 +0000
% 13.77/2.69 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 13.77/2.69 git: non_committed_changes: false
% 13.77/2.69 git: last_make_outside_of_git: false
% 13.77/2.69
% 13.77/2.69 ------ Parsing...
% 13.77/2.69 ------ Clausification by vclausify_rel & Parsing by iProver...
% 13.77/2.69
% 13.77/2.69 ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 13.77/2.69
% 13.77/2.69 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 13.77/2.69
% 13.77/2.69 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 13.77/2.69 ------ Proving...
% 13.77/2.69 ------ Problem Properties
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69 clauses 1171
% 13.77/2.69 conjectures 1
% 13.77/2.69 EPR 711
% 13.77/2.69 Horn 902
% 13.77/2.69 unary 226
% 13.77/2.69 binary 456
% 13.77/2.69 lits 3736
% 13.77/2.69 lits eq 197
% 13.77/2.69 fd_pure 0
% 13.77/2.69 fd_pseudo 0
% 13.77/2.69 fd_cond 0
% 13.77/2.69 fd_pseudo_cond 66
% 13.77/2.69 AC symbols 0
% 13.77/2.69
% 13.77/2.69 ------ Input Options Time Limit: Unbounded
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69 ------
% 13.77/2.69 Current options:
% 13.77/2.69 ------
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69 ------ Proving...
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69 ------ Proving...
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69 ------ Proving...
% 13.77/2.69
% 13.77/2.69
% 13.77/2.69 % SZS status Theorem for theBenchmark.p
% 13.77/2.69
% 13.77/2.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 13.77/2.69
% 13.77/2.69
%------------------------------------------------------------------------------