TSTP Solution File: SWB002+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWB002+4 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 0.46s 1.15s
% Output : CNFRefutation 0.46s
% 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(f81,conjecture,
? [X10,X11] :
( iext(uri_ex_q,X11,X10)
& iext(uri_ex_p,X10,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(f82,negated_conjecture,
~ ? [X10,X11] :
( iext(uri_ex_q,X11,X10)
& iext(uri_ex_p,X10,X11) ),
inference(negated_conjecture,[],[f81]) ).
fof(f83,axiom,
? [X12] :
( iext(uri_ex_q,X12,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f102,plain,
~ ? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
inference(rectify,[],[f82]) ).
fof(f103,plain,
? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) ),
inference(rectify,[],[f83]) ).
fof(f125,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(ennf_transformation,[],[f102]) ).
fof(f129,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(f130,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])],[f103,f129]) ).
fof(f218,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f219,plain,
iext(uri_ex_p,uri_ex_s,sK0),
inference(cnf_transformation,[],[f130]) ).
fof(f220,plain,
iext(uri_ex_q,sK0,uri_ex_s),
inference(cnf_transformation,[],[f130]) ).
cnf(c_136,negated_conjecture,
( ~ iext(uri_ex_q,X0,X1)
| ~ iext(uri_ex_p,X1,X0) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_137,plain,
iext(uri_ex_q,sK0,uri_ex_s),
inference(cnf_transformation,[],[f220]) ).
cnf(c_138,plain,
iext(uri_ex_p,uri_ex_s,sK0),
inference(cnf_transformation,[],[f219]) ).
cnf(c_496,plain,
~ iext(uri_ex_p,uri_ex_s,sK0),
inference(resolution,[status(thm)],[c_137,c_136]) ).
cnf(c_497,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_496,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB002+4 : TPTP v8.1.2. Released v5.2.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 07:21:35 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15 git: last_make_outside_of_git: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sf_s rm: 2 0s sf_e sf_s rm: 0 0s sf_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.46/1.15 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15 ------ Proving...
% 0.46/1.15 ------ Problem Properties
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses 85
% 0.46/1.15 conjectures 1
% 0.46/1.15 EPR 85
% 0.46/1.15 Horn 85
% 0.46/1.15 unary 62
% 0.46/1.15 binary 17
% 0.46/1.15 lits 114
% 0.46/1.15 lits eq 0
% 0.46/1.15 fd_pure 0
% 0.46/1.15 fd_pseudo 0
% 0.46/1.15 fd_cond 0
% 0.46/1.15 fd_pseudo_cond 0
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Schedule EPR Horn non eq is on
% 0.46/1.15
% 0.46/1.15 ------ no equalities: superposition off
% 0.46/1.15
% 0.46/1.15 ------ Option_epr_horn Time Limit: Unbounded
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------
% 0.46/1.15 Current options:
% 0.46/1.15 ------
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Proving...
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------