TSTP Solution File: SWB002+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 1.15s 1.02s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 4 |; 7 &)
% ( 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 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,axiom,
? [X2] :
( iext(uri_ex_q,X2,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f4,plain,
? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f6,plain,
( ? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) )
=> ( iext(uri_ex_q,sK0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( iext(uri_ex_q,sK0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f6]) ).
fof(f8,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
iext(uri_ex_p,uri_ex_s,sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
iext(uri_ex_q,sK0,uri_ex_s),
inference(cnf_transformation,[],[f7]) ).
cnf(c_49,negated_conjecture,
( ~ iext(uri_ex_q,X0,X1)
| ~ iext(uri_ex_p,X1,X0) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_50,plain,
iext(uri_ex_q,sK0,uri_ex_s),
inference(cnf_transformation,[],[f10]) ).
cnf(c_51,plain,
iext(uri_ex_p,uri_ex_s,sK0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_54,plain,
iext(uri_ex_q,sK0,uri_ex_s),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_55,negated_conjecture,
( ~ iext(uri_ex_q,X0_14,X1_14)
| ~ iext(uri_ex_p,X1_14,X0_14) ),
inference(subtyping,[status(esa)],[c_49]) ).
cnf(c_56,plain,
~ iext(uri_ex_p,uri_ex_s,sK0),
inference(resolution,[status(thm)],[c_54,c_55]) ).
cnf(c_57,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_56,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun Aug 27 07:25:29 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.15/1.02 % SZS status Started for theBenchmark.p
% 1.15/1.02 % SZS status Theorem for theBenchmark.p
% 1.15/1.02
% 1.15/1.02 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.15/1.02
% 1.15/1.02 ------ iProver source info
% 1.15/1.02
% 1.15/1.02 git: date: 2023-05-31 18:12:56 +0000
% 1.15/1.02 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.15/1.02 git: non_committed_changes: false
% 1.15/1.02 git: last_make_outside_of_git: false
% 1.15/1.02
% 1.15/1.02 ------ Parsing...
% 1.15/1.02 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 1.15/1.02
% 1.15/1.02
% 1.15/1.02 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.15/1.02
% 1.15/1.02 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.15/1.02 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.15/1.02 ------ Proving...
% 1.15/1.02 ------ Problem Properties
% 1.15/1.02
% 1.15/1.02
% 1.15/1.02 clauses 3
% 1.15/1.02 conjectures 1
% 1.15/1.02 EPR 3
% 1.15/1.02 Horn 3
% 1.15/1.02 unary 2
% 1.15/1.02 binary 1
% 1.15/1.02 lits 4
% 1.15/1.02 lits eq 0
% 1.15/1.02 fd_pure 0
% 1.15/1.02 fd_pseudo 0
% 1.15/1.02 fd_cond 0
% 1.15/1.02 fd_pseudo_cond 0
% 1.15/1.02 AC symbols 0
% 1.15/1.02
% 1.15/1.02 ------ Schedule EPR Horn non eq is on
% 1.15/1.02
% 1.15/1.02 ------ no equalities: superposition off
% 1.15/1.02
% 1.15/1.02 ------ Option_epr_horn Time Limit: Unbounded
% 1.15/1.02
% 1.15/1.02
% 1.15/1.02 ------
% 1.15/1.02 Current options:
% 1.15/1.02 ------
% 1.15/1.02
% 1.15/1.02
% 1.15/1.02
% 1.15/1.02
% 1.15/1.02 ------ Proving...
% 1.15/1.02
% 1.15/1.02
% 1.15/1.02 % SZS status Theorem for theBenchmark.p
% 1.15/1.02
% 1.15/1.02 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.15/1.02
% 1.15/1.02
%------------------------------------------------------------------------------