TSTP Solution File: KRS075+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS075+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 2.47s 1.15s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 8 unt; 0 def)
% Number of atoms : 185 ( 18 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 205 ( 78 ~; 70 |; 44 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 111 ( 0 sgn 72 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( cp(X4)
& rf(X3,X4) )
& ? [X4] :
( cowlThing(X4)
& rs(X3,X4) )
& ? [X4] :
( ~ cp(X4)
& rf1(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X3,X4,X5] :
( ( rf(X3,X5)
& rf(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f23,axiom,
! [X3,X4,X5] :
( ( rf1(X3,X5)
& rf1(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_19_02584),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f29,axiom,
! [X3,X4] :
( rs(X3,X4)
=> rf1(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(f30,axiom,
! [X3,X4] :
( rs(X3,X4)
=> rf(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f33,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X3] :
( ~ cp(X3)
& rf1(X0,X3) ) ) ),
inference(rectify,[],[f21]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f22]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f23]) ).
fof(f40,plain,
! [X0,X1] :
( rs(X0,X1)
=> rf1(X0,X1) ),
inference(rectify,[],[f29]) ).
fof(f41,plain,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
inference(rectify,[],[f30]) ).
fof(f78,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f79,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(ennf_transformation,[],[f35]) ).
fof(f81,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(flattening,[],[f80]) ).
fof(f84,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f40]) ).
fof(f85,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f87,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( cp(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X3] :
( ~ cp(X3)
& rf1(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f88,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( cp(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X2] :
( cowlThing(X2)
& rs(X0,X2) )
& ? [X3] :
( ~ cp(X3)
& rf1(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( cp(X3)
| ~ rf1(X0,X3) ) )
& ( ( ? [X4] :
( cp(X4)
& rf(X0,X4) )
& ? [X5] :
( cowlThing(X5)
& rs(X0,X5) )
& ? [X6] :
( ~ cp(X6)
& rf1(X0,X6) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f88]) ).
fof(f90,plain,
! [X0] :
( ? [X4] :
( cp(X4)
& rf(X0,X4) )
=> ( cp(sK0(X0))
& rf(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f91,plain,
! [X0] :
( ? [X5] :
( cowlThing(X5)
& rs(X0,X5) )
=> ( cowlThing(sK1(X0))
& rs(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
! [X0] :
( ? [X6] :
( ~ cp(X6)
& rf1(X0,X6) )
=> ( ~ cp(sK2(X0))
& rf1(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp(X1)
| ~ rf(X0,X1) )
| ! [X2] :
( ~ cowlThing(X2)
| ~ rs(X0,X2) )
| ! [X3] :
( cp(X3)
| ~ rf1(X0,X3) ) )
& ( ( cp(sK0(X0))
& rf(X0,sK0(X0))
& cowlThing(sK1(X0))
& rs(X0,sK1(X0))
& ~ cp(sK2(X0))
& rf1(X0,sK2(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f89,f92,f91,f90]) ).
fof(f119,plain,
! [X0] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f120,plain,
! [X0] :
( ~ cp(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f121,plain,
! [X0] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f123,plain,
! [X0] :
( rf(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f124,plain,
! [X0] :
( cp(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f126,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f127,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f135,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
inference(cnf_transformation,[],[f28]) ).
fof(f136,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
fof(f137,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_54,plain,
( ~ cUnsatisfiable(X0)
| cp(sK0(X0)) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_55,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_57,plain,
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f121]) ).
cnf(c_58,plain,
( ~ cp(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f120]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f119]) ).
cnf(c_60,plain,
( ~ rf(X0,X1)
| ~ rf(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_61,plain,
( ~ rf1(X0,X1)
| ~ rf1(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f127]) ).
cnf(c_69,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
inference(cnf_transformation,[],[f135]) ).
cnf(c_70,plain,
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
cnf(c_71,plain,
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f137]) ).
cnf(c_76,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_02584)
| cp(sK0(i2003_11_14_17_19_02584)) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_1065,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK1(X0)) ),
inference(superposition,[status(thm)],[c_57,c_70]) ).
cnf(c_1073,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK1(X0)) ),
inference(superposition,[status(thm)],[c_57,c_71]) ).
cnf(c_1087,plain,
( ~ rf(X0,X1)
| ~ cUnsatisfiable(X0)
| sK0(X0) = X1 ),
inference(superposition,[status(thm)],[c_55,c_60]) ).
cnf(c_1149,plain,
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK1(X0) ),
inference(superposition,[status(thm)],[c_1073,c_1087]) ).
cnf(c_1157,plain,
sK0(i2003_11_14_17_19_02584) = sK1(i2003_11_14_17_19_02584),
inference(superposition,[status(thm)],[c_69,c_1149]) ).
cnf(c_1159,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_02584)
| rf1(i2003_11_14_17_19_02584,sK0(i2003_11_14_17_19_02584)) ),
inference(superposition,[status(thm)],[c_1157,c_1065]) ).
cnf(c_1162,plain,
rf1(i2003_11_14_17_19_02584,sK0(i2003_11_14_17_19_02584)),
inference(forward_subsumption_resolution,[status(thm)],[c_1159,c_69]) ).
cnf(c_1170,plain,
( ~ rf1(i2003_11_14_17_19_02584,X0)
| sK0(i2003_11_14_17_19_02584) = X0 ),
inference(superposition,[status(thm)],[c_1162,c_61]) ).
cnf(c_1190,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_02584)
| sK0(i2003_11_14_17_19_02584) = sK2(i2003_11_14_17_19_02584) ),
inference(superposition,[status(thm)],[c_59,c_1170]) ).
cnf(c_1193,plain,
sK0(i2003_11_14_17_19_02584) = sK2(i2003_11_14_17_19_02584),
inference(forward_subsumption_resolution,[status(thm)],[c_1190,c_69]) ).
cnf(c_1195,plain,
( ~ cp(sK0(i2003_11_14_17_19_02584))
| ~ cUnsatisfiable(i2003_11_14_17_19_02584) ),
inference(superposition,[status(thm)],[c_1193,c_58]) ).
cnf(c_1196,plain,
~ cp(sK0(i2003_11_14_17_19_02584)),
inference(forward_subsumption_resolution,[status(thm)],[c_1195,c_69]) ).
cnf(c_1197,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1196,c_76,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS075+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n005.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 : Thu May 2 22:38:41 EDT 2024
% 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.47/1.15 % SZS status Started for theBenchmark.p
% 2.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.47/1.15
% 2.47/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.47/1.15
% 2.47/1.15 ------ iProver source info
% 2.47/1.15
% 2.47/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.47/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.47/1.15 git: non_committed_changes: false
% 2.47/1.15
% 2.47/1.15 ------ Parsing...
% 2.47/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.47/1.15
% 2.47/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.47/1.15
% 2.47/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.47/1.15
% 2.47/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.47/1.15 ------ Proving...
% 2.47/1.15 ------ Problem Properties
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 clauses 12
% 2.47/1.15 conjectures 0
% 2.47/1.15 EPR 7
% 2.47/1.15 Horn 11
% 2.47/1.15 unary 1
% 2.47/1.15 binary 7
% 2.47/1.15 lits 30
% 2.47/1.15 lits eq 3
% 2.47/1.15 fd_pure 0
% 2.47/1.15 fd_pseudo 0
% 2.47/1.15 fd_cond 0
% 2.47/1.15 fd_pseudo_cond 3
% 2.47/1.15 AC symbols 0
% 2.47/1.15
% 2.47/1.15 ------ Schedule dynamic 5 is on
% 2.47/1.15
% 2.47/1.15 ------ no conjectures: strip conj schedule
% 2.47/1.15
% 2.47/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 ------
% 2.47/1.15 Current options:
% 2.47/1.15 ------
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 ------ Proving...
% 2.47/1.15
% 2.47/1.15
% 2.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.47/1.15
% 2.47/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.47/1.15
% 2.47/1.15
%------------------------------------------------------------------------------