TSTP Solution File: KRS069+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS069+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:31 EDT 2024
% Result : Unsatisfiable 0.43s 1.12s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 7 unt; 0 def)
% Number of atoms : 183 ( 18 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 204 ( 77 ~; 70 |; 44 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 113 ( 0 sgn 72 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( cp2(X4)
& rf3(X3,X4) )
& ? [X4] :
( ~ cp1(X4)
& rf2(X3,X4) )
& ? [X4] :
( cp1(X4)
& rf1(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f17,axiom,
! [X3,X4,X5] :
( ( rf1(X3,X5)
& rf1(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f18,axiom,
! [X3,X4,X5] :
( ( rf2(X3,X5)
& rf2(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f20,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f21,axiom,
! [X3,X4] :
( rf3(X3,X4)
=> rf1(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f22,axiom,
! [X3,X4] :
( rf3(X3,X4)
=> rf2(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f25,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( cp2(X1)
& rf3(X0,X1) )
& ? [X2] :
( ~ cp1(X2)
& rf2(X0,X2) )
& ? [X3] :
( cp1(X3)
& rf1(X0,X3) ) ) ),
inference(rectify,[],[f16]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f17]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( rf2(X0,X2)
& rf2(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f18]) ).
fof(f29,plain,
! [X0,X1] :
( rf3(X0,X1)
=> rf1(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f30,plain,
! [X0,X1] :
( rf3(X0,X1)
=> rf2(X0,X1) ),
inference(rectify,[],[f22]) ).
fof(f57,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f58,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf2(X0,X2)
| ~ rf2(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f60,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf2(X0,X2)
| ~ rf2(X0,X1) ),
inference(flattening,[],[f59]) ).
fof(f63,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rf3(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f64,plain,
! [X0,X1] :
( rf2(X0,X1)
| ~ rf3(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f66,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp2(X1)
| ~ rf3(X0,X1) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X3] :
( ~ cp1(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X1] :
( cp2(X1)
& rf3(X0,X1) )
& ? [X2] :
( ~ cp1(X2)
& rf2(X0,X2) )
& ? [X3] :
( cp1(X3)
& rf1(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f67,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp2(X1)
| ~ rf3(X0,X1) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X3] :
( ~ cp1(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X1] :
( cp2(X1)
& rf3(X0,X1) )
& ? [X2] :
( ~ cp1(X2)
& rf2(X0,X2) )
& ? [X3] :
( cp1(X3)
& rf1(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f66]) ).
fof(f68,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp2(X1)
| ~ rf3(X0,X1) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X3] :
( ~ cp1(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X4] :
( cp2(X4)
& rf3(X0,X4) )
& ? [X5] :
( ~ cp1(X5)
& rf2(X0,X5) )
& ? [X6] :
( cp1(X6)
& rf1(X0,X6) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f67]) ).
fof(f69,plain,
! [X0] :
( ? [X4] :
( cp2(X4)
& rf3(X0,X4) )
=> ( cp2(sK0(X0))
& rf3(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f70,plain,
! [X0] :
( ? [X5] :
( ~ cp1(X5)
& rf2(X0,X5) )
=> ( ~ cp1(sK1(X0))
& rf2(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f71,plain,
! [X0] :
( ? [X6] :
( cp1(X6)
& rf1(X0,X6) )
=> ( cp1(sK2(X0))
& rf1(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp2(X1)
| ~ rf3(X0,X1) )
| ! [X2] :
( cp1(X2)
| ~ rf2(X0,X2) )
| ! [X3] :
( ~ cp1(X3)
| ~ rf1(X0,X3) ) )
& ( ( cp2(sK0(X0))
& rf3(X0,sK0(X0))
& ~ cp1(sK1(X0))
& rf2(X0,sK1(X0))
& cp1(sK2(X0))
& rf1(X0,sK2(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f68,f71,f70,f69]) ).
fof(f90,plain,
! [X0] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f91,plain,
! [X0] :
( cp1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f92,plain,
! [X0] :
( rf2(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f93,plain,
! [X0] :
( ~ cp1(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f94,plain,
! [X0] :
( rf3(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f97,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f98,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf2(X0,X2)
| ~ rf2(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f100,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(cnf_transformation,[],[f20]) ).
fof(f101,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rf3(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f102,plain,
! [X0,X1] :
( rf2(X0,X1)
| ~ rf3(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_55,plain,
( ~ cUnsatisfiable(X0)
| rf3(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_56,plain,
( ~ cp1(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_57,plain,
( ~ cUnsatisfiable(X0)
| rf2(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f92]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| cp1(sK2(X0)) ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f90]) ).
cnf(c_60,plain,
( ~ rf1(X0,X1)
| ~ rf1(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f97]) ).
cnf(c_61,plain,
( ~ rf2(X0,X1)
| ~ rf2(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f98]) ).
cnf(c_63,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(cnf_transformation,[],[f100]) ).
cnf(c_64,plain,
( ~ rf3(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
cnf(c_65,plain,
( ~ rf3(X0,X1)
| rf2(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_696,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK0(X0)) ),
inference(superposition,[status(thm)],[c_55,c_64]) ).
cnf(c_704,plain,
( ~ cUnsatisfiable(X0)
| rf2(X0,sK0(X0)) ),
inference(superposition,[status(thm)],[c_55,c_65]) ).
cnf(c_729,plain,
( ~ rf1(X0,X1)
| ~ cUnsatisfiable(X0)
| sK2(X0) = X1 ),
inference(superposition,[status(thm)],[c_59,c_60]) ).
cnf(c_740,plain,
( ~ rf2(X0,X1)
| ~ cUnsatisfiable(X0)
| sK1(X0) = X1 ),
inference(superposition,[status(thm)],[c_57,c_61]) ).
cnf(c_781,plain,
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK2(X0) ),
inference(superposition,[status(thm)],[c_696,c_729]) ).
cnf(c_789,plain,
sK0(i2003_11_14_17_18_2750) = sK2(i2003_11_14_17_18_2750),
inference(superposition,[status(thm)],[c_63,c_781]) ).
cnf(c_791,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_2750)
| cp1(sK0(i2003_11_14_17_18_2750)) ),
inference(superposition,[status(thm)],[c_789,c_58]) ).
cnf(c_792,plain,
cp1(sK0(i2003_11_14_17_18_2750)),
inference(forward_subsumption_resolution,[status(thm)],[c_791,c_63]) ).
cnf(c_813,plain,
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK1(X0) ),
inference(superposition,[status(thm)],[c_704,c_740]) ).
cnf(c_821,plain,
sK0(i2003_11_14_17_18_2750) = sK1(i2003_11_14_17_18_2750),
inference(superposition,[status(thm)],[c_63,c_813]) ).
cnf(c_823,plain,
( ~ cp1(sK0(i2003_11_14_17_18_2750))
| ~ cUnsatisfiable(i2003_11_14_17_18_2750) ),
inference(superposition,[status(thm)],[c_821,c_56]) ).
cnf(c_824,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_823,c_63,c_792]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KRS069+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n011.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 22:44:18 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.43/1.12 % SZS status Started for theBenchmark.p
% 0.43/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.12
% 0.43/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.12
% 0.43/1.12 ------ iProver source info
% 0.43/1.12
% 0.43/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.12 git: non_committed_changes: false
% 0.43/1.12
% 0.43/1.12 ------ Parsing...
% 0.43/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.12
% 0.43/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 0.43/1.12
% 0.43/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.12
% 0.43/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.43/1.12 ------ Proving...
% 0.43/1.12 ------ Problem Properties
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 clauses 12
% 0.43/1.12 conjectures 0
% 0.43/1.12 EPR 6
% 0.43/1.12 Horn 11
% 0.43/1.12 unary 1
% 0.43/1.12 binary 7
% 0.43/1.12 lits 31
% 0.43/1.12 lits eq 3
% 0.43/1.12 fd_pure 0
% 0.43/1.12 fd_pseudo 0
% 0.43/1.12 fd_cond 0
% 0.43/1.12 fd_pseudo_cond 3
% 0.43/1.12 AC symbols 0
% 0.43/1.12
% 0.43/1.12 ------ Schedule dynamic 5 is on
% 0.43/1.12
% 0.43/1.12 ------ no conjectures: strip conj schedule
% 0.43/1.12
% 0.43/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 ------
% 0.43/1.12 Current options:
% 0.43/1.12 ------
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 ------ Proving...
% 0.43/1.12
% 0.43/1.12
% 0.43/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/1.12
% 0.43/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.12
% 0.43/1.12
%------------------------------------------------------------------------------