TSTP Solution File: SWB002+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWB002+3 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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 3.41s 1.17s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 10 ~; 4 |; 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(f139,conjecture,
? [X20,X21] :
( iext(uri_ex_q,X21,X20)
& iext(uri_ex_p,X20,X21) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(f140,negated_conjecture,
~ ? [X20,X21] :
( iext(uri_ex_q,X21,X20)
& iext(uri_ex_p,X20,X21) ),
inference(negated_conjecture,[],[f139]) ).
fof(f141,axiom,
? [X22] :
( iext(uri_ex_q,X22,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X22) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f209,plain,
~ ? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
inference(rectify,[],[f140]) ).
fof(f210,plain,
? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) ),
inference(rectify,[],[f141]) ).
fof(f280,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(ennf_transformation,[],[f209]) ).
fof(f384,plain,
( ? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) )
=> ( iext(uri_ex_q,sK26,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK26) ) ),
introduced(choice_axiom,[]) ).
fof(f385,plain,
( iext(uri_ex_q,sK26,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK26) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26])],[f210,f384]) ).
fof(f640,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f280]) ).
fof(f641,plain,
iext(uri_ex_p,uri_ex_s,sK26),
inference(cnf_transformation,[],[f385]) ).
fof(f642,plain,
iext(uri_ex_q,sK26,uri_ex_s),
inference(cnf_transformation,[],[f385]) ).
cnf(c_303,negated_conjecture,
( ~ iext(uri_ex_q,X0,X1)
| ~ iext(uri_ex_p,X1,X0) ),
inference(cnf_transformation,[],[f640]) ).
cnf(c_304,plain,
iext(uri_ex_q,sK26,uri_ex_s),
inference(cnf_transformation,[],[f642]) ).
cnf(c_305,plain,
iext(uri_ex_p,uri_ex_s,sK26),
inference(cnf_transformation,[],[f641]) ).
cnf(c_9921,plain,
( ~ iext(uri_ex_q,sK26,uri_ex_s)
| ~ iext(uri_ex_p,uri_ex_s,sK26) ),
inference(instantiation,[status(thm)],[c_303]) ).
cnf(c_9922,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9921,c_304,c_305]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWB002+3 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 06:59:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.41/1.17 % SZS status Started for theBenchmark.p
% 3.41/1.17 % SZS status Theorem for theBenchmark.p
% 3.41/1.17
% 3.41/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.41/1.17
% 3.41/1.17 ------ iProver source info
% 3.41/1.17
% 3.41/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.41/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.41/1.17 git: non_committed_changes: false
% 3.41/1.17 git: last_make_outside_of_git: false
% 3.41/1.17
% 3.41/1.17 ------ Parsing...
% 3.41/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.41/1.17
% 3.41/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.41/1.17
% 3.41/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.41/1.17 ------ Proving...
% 3.41/1.17 ------ Problem Properties
% 3.41/1.17
% 3.41/1.17
% 3.41/1.17 clauses 214
% 3.41/1.17 conjectures 1
% 3.41/1.17 EPR 182
% 3.41/1.17 Horn 196
% 3.41/1.17 unary 74
% 3.41/1.17 binary 60
% 3.41/1.17 lits 551
% 3.41/1.17 lits eq 0
% 3.41/1.17 fd_pure 0
% 3.41/1.17 fd_pseudo 0
% 3.41/1.17 fd_cond 0
% 3.41/1.17 fd_pseudo_cond 0
% 3.41/1.17 AC symbols 0
% 3.41/1.17
% 3.41/1.17 ------ Schedule dynamic 5 is on
% 3.41/1.17
% 3.41/1.17 ------ no equalities: superposition off
% 3.41/1.17
% 3.41/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.41/1.17
% 3.41/1.17
% 3.41/1.17 ------
% 3.41/1.17 Current options:
% 3.41/1.17 ------
% 3.41/1.17
% 3.41/1.17
% 3.41/1.17
% 3.41/1.17
% 3.41/1.17 ------ Proving...
% 3.41/1.17
% 3.41/1.17
% 3.41/1.17 % SZS status Theorem for theBenchmark.p
% 3.41/1.17
% 3.41/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.17
% 3.41/1.17
%------------------------------------------------------------------------------