TSTP Solution File: KRS074+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS074+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 : Fri May 3 02:33:32 EDT 2024
% Result : Unsatisfiable 0.46s 1.15s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 127 ( 3 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 150 ( 52 ~; 44 |; 46 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 60 ( 0 sgn 29 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ! [X4] :
( rs(X3,X4)
=> ~ cp(X4) )
& ? [X4] :
( ? [X5] :
( cp(X5)
& rinvS(X4,X5) )
& cp(X4)
& rs(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_18_59896),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f33,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rs(X0,X1)
=> ~ cp(X1) )
& ? [X2] :
( ? [X3] :
( cp(X3)
& rinvS(X2,X3) )
& cp(X2)
& rs(X0,X2) ) ) ),
inference(rectify,[],[f21]) ).
fof(f78,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( ~ cp(X1)
| ~ rs(X0,X1) )
& ? [X2] :
( ? [X3] :
( cp(X3)
& rinvS(X2,X3) )
& cp(X2)
& rs(X0,X2) ) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f88,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1] :
( cp(X1)
& rs(X0,X1) )
| ! [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rinvS(X2,X3) )
| ~ cp(X2)
| ~ rs(X0,X2) ) )
& ( ( ! [X1] :
( ~ cp(X1)
| ~ rs(X0,X1) )
& ? [X2] :
( ? [X3] :
( cp(X3)
& rinvS(X2,X3) )
& cp(X2)
& rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f89,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1] :
( cp(X1)
& rs(X0,X1) )
| ! [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rinvS(X2,X3) )
| ~ cp(X2)
| ~ rs(X0,X2) ) )
& ( ( ! [X1] :
( ~ cp(X1)
| ~ rs(X0,X1) )
& ? [X2] :
( ? [X3] :
( cp(X3)
& rinvS(X2,X3) )
& cp(X2)
& rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f88]) ).
fof(f90,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1] :
( cp(X1)
& rs(X0,X1) )
| ! [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rinvS(X2,X3) )
| ~ cp(X2)
| ~ rs(X0,X2) ) )
& ( ( ! [X4] :
( ~ cp(X4)
| ~ rs(X0,X4) )
& ? [X5] :
( ? [X6] :
( cp(X6)
& rinvS(X5,X6) )
& cp(X5)
& rs(X0,X5) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f89]) ).
fof(f91,plain,
! [X0] :
( ? [X1] :
( cp(X1)
& rs(X0,X1) )
=> ( cp(sK0(X0))
& rs(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
! [X0] :
( ? [X5] :
( ? [X6] :
( cp(X6)
& rinvS(X5,X6) )
& cp(X5)
& rs(X0,X5) )
=> ( ? [X6] :
( cp(X6)
& rinvS(sK1(X0),X6) )
& cp(sK1(X0))
& rs(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X0] :
( ? [X6] :
( cp(X6)
& rinvS(sK1(X0),X6) )
=> ( cp(sK2(X0))
& rinvS(sK1(X0),sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f94,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ( cp(sK0(X0))
& rs(X0,sK0(X0)) )
| ! [X2] :
( ! [X3] :
( ~ cp(X3)
| ~ rinvS(X2,X3) )
| ~ cp(X2)
| ~ rs(X0,X2) ) )
& ( ( ! [X4] :
( ~ cp(X4)
| ~ rs(X0,X4) )
& cp(sK2(X0))
& rinvS(sK1(X0),sK2(X0))
& cp(sK1(X0))
& rs(X0,sK1(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f90,f93,f92,f91]) ).
fof(f120,plain,
! [X0] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f121,plain,
! [X0] :
( cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f124,plain,
! [X0,X4] :
( ~ cp(X4)
| ~ rs(X0,X4)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f136,plain,
cUnsatisfiable(i2003_11_14_17_18_59896),
inference(cnf_transformation,[],[f28]) ).
cnf(c_55,plain,
( ~ rs(X0,X1)
| ~ cUnsatisfiable(X0)
| ~ cp(X1) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| cp(sK1(X0)) ),
inference(cnf_transformation,[],[f121]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f120]) ).
cnf(c_69,plain,
cUnsatisfiable(i2003_11_14_17_18_59896),
inference(cnf_transformation,[],[f136]) ).
cnf(c_100,plain,
( ~ cUnsatisfiable(X0)
| cp(sK1(X0)) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
cnf(c_102,plain,
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
cnf(c_401,plain,
( X0 != i2003_11_14_17_18_59896
| rs(X0,sK1(X0)) ),
inference(resolution_lifted,[status(thm)],[c_102,c_69]) ).
cnf(c_402,plain,
rs(i2003_11_14_17_18_59896,sK1(i2003_11_14_17_18_59896)),
inference(unflattening,[status(thm)],[c_401]) ).
cnf(c_406,plain,
( X0 != i2003_11_14_17_18_59896
| cp(sK1(X0)) ),
inference(resolution_lifted,[status(thm)],[c_100,c_69]) ).
cnf(c_407,plain,
cp(sK1(i2003_11_14_17_18_59896)),
inference(unflattening,[status(thm)],[c_406]) ).
cnf(c_421,plain,
( X0 != i2003_11_14_17_18_59896
| ~ rs(X0,X1)
| ~ cp(X1) ),
inference(resolution_lifted,[status(thm)],[c_55,c_69]) ).
cnf(c_422,plain,
( ~ rs(i2003_11_14_17_18_59896,X0)
| ~ cp(X0) ),
inference(unflattening,[status(thm)],[c_421]) ).
cnf(c_906,plain,
~ cp(sK1(i2003_11_14_17_18_59896)),
inference(superposition,[status(thm)],[c_402,c_422]) ).
cnf(c_907,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_906,c_407]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS074+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n025.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 : Thu May 2 22:56:28 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --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 Unsatisfiable for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_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 14
% 0.46/1.15 conjectures 0
% 0.46/1.15 EPR 6
% 0.46/1.15 Horn 14
% 0.46/1.15 unary 4
% 0.46/1.15 binary 5
% 0.46/1.15 lits 33
% 0.46/1.15 lits eq 3
% 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 3
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Schedule dynamic 5 is on
% 0.46/1.15
% 0.46/1.15 ------ no conjectures: strip conj schedule
% 0.46/1.15
% 0.46/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 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 Unsatisfiable 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
%------------------------------------------------------------------------------