TSTP Solution File: KRS076+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS076+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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.22s 1.20s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 8 unt; 0 def)
% Number of atoms : 232 ( 18 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 263 ( 97 ~; 87 |; 60 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 149 ( 0 sgn 94 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( ! [X5] :
( rinvF1(X4,X5)
=> ? [X6] :
( cowlThing(X6)
& rs(X5,X6) ) )
& ~ cp(X4)
& rf1(X3,X4) )
& ? [X4] :
( cp(X4)
& rf(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X3,X4,X5] :
( ( rf(X3,X5)
& rf(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f23,axiom,
! [X3,X4,X5] :
( ( rf1(X3,X5)
& rf1(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f25,axiom,
! [X3,X4] :
( rinvF1(X3,X4)
<=> rf1(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_19_06193),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f29,axiom,
! [X3,X4] :
( rs(X3,X4)
=> rf1(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(f30,axiom,
! [X3,X4] :
( rs(X3,X4)
=> rf(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(f33,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( ! [X2] :
( rinvF1(X1,X2)
=> ? [X3] :
( cowlThing(X3)
& rs(X2,X3) ) )
& ~ cp(X1)
& rf1(X0,X1) )
& ? [X4] :
( cp(X4)
& rf(X0,X4) ) ) ),
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(f37,plain,
! [X0,X1] :
( rinvF1(X0,X1)
<=> rf1(X1,X0) ),
inference(rectify,[],[f25]) ).
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] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( ! [X2] :
( ? [X3] :
( cowlThing(X3)
& rs(X2,X3) )
| ~ rinvF1(X1,X2) )
& ~ cp(X1)
& rf1(X0,X1) )
& ? [X4] :
( cp(X4)
& rf(X0,X4) ) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f79,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f80,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(flattening,[],[f79]) ).
fof(f81,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(ennf_transformation,[],[f35]) ).
fof(f82,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(flattening,[],[f81]) ).
fof(f85,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f40]) ).
fof(f86,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f88,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cowlThing(X3)
| ~ rs(X2,X3) )
& rinvF1(X1,X2) )
| cp(X1)
| ~ rf1(X0,X1) )
| ! [X4] :
( ~ cp(X4)
| ~ rf(X0,X4) ) )
& ( ( ? [X1] :
( ! [X2] :
( ? [X3] :
( cowlThing(X3)
& rs(X2,X3) )
| ~ rinvF1(X1,X2) )
& ~ cp(X1)
& rf1(X0,X1) )
& ? [X4] :
( cp(X4)
& rf(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f89,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cowlThing(X3)
| ~ rs(X2,X3) )
& rinvF1(X1,X2) )
| cp(X1)
| ~ rf1(X0,X1) )
| ! [X4] :
( ~ cp(X4)
| ~ rf(X0,X4) ) )
& ( ( ? [X1] :
( ! [X2] :
( ? [X3] :
( cowlThing(X3)
& rs(X2,X3) )
| ~ rinvF1(X1,X2) )
& ~ cp(X1)
& rf1(X0,X1) )
& ? [X4] :
( cp(X4)
& rf(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f88]) ).
fof(f90,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cowlThing(X3)
| ~ rs(X2,X3) )
& rinvF1(X1,X2) )
| cp(X1)
| ~ rf1(X0,X1) )
| ! [X4] :
( ~ cp(X4)
| ~ rf(X0,X4) ) )
& ( ( ? [X5] :
( ! [X6] :
( ? [X7] :
( cowlThing(X7)
& rs(X6,X7) )
| ~ rinvF1(X5,X6) )
& ~ cp(X5)
& rf1(X0,X5) )
& ? [X8] :
( cp(X8)
& rf(X0,X8) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f89]) ).
fof(f91,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( ~ cowlThing(X3)
| ~ rs(X2,X3) )
& rinvF1(X1,X2) )
=> ( ! [X3] :
( ~ cowlThing(X3)
| ~ rs(sK0(X1),X3) )
& rinvF1(X1,sK0(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
! [X0] :
( ? [X5] :
( ! [X6] :
( ? [X7] :
( cowlThing(X7)
& rs(X6,X7) )
| ~ rinvF1(X5,X6) )
& ~ cp(X5)
& rf1(X0,X5) )
=> ( ! [X6] :
( ? [X7] :
( cowlThing(X7)
& rs(X6,X7) )
| ~ rinvF1(sK1(X0),X6) )
& ~ cp(sK1(X0))
& rf1(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X6] :
( ? [X7] :
( cowlThing(X7)
& rs(X6,X7) )
=> ( cowlThing(sK2(X6))
& rs(X6,sK2(X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f94,plain,
! [X0] :
( ? [X8] :
( cp(X8)
& rf(X0,X8) )
=> ( cp(sK3(X0))
& rf(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f95,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ( ! [X3] :
( ~ cowlThing(X3)
| ~ rs(sK0(X1),X3) )
& rinvF1(X1,sK0(X1)) )
| cp(X1)
| ~ rf1(X0,X1) )
| ! [X4] :
( ~ cp(X4)
| ~ rf(X0,X4) ) )
& ( ( ! [X6] :
( ( cowlThing(sK2(X6))
& rs(X6,sK2(X6)) )
| ~ rinvF1(sK1(X0),X6) )
& ~ cp(sK1(X0))
& rf1(X0,sK1(X0))
& cp(sK3(X0))
& rf(X0,sK3(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f90,f94,f93,f92,f91]) ).
fof(f97,plain,
! [X0,X1] :
( ( rinvF1(X0,X1)
| ~ rf1(X1,X0) )
& ( rf1(X1,X0)
| ~ rinvF1(X0,X1) ) ),
inference(nnf_transformation,[],[f37]) ).
fof(f121,plain,
! [X0] :
( rf(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f122,plain,
! [X0] :
( cp(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f123,plain,
! [X0] :
( rf1(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f124,plain,
! [X0] :
( ~ cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f125,plain,
! [X0,X6] :
( rs(X6,sK2(X6))
| ~ rinvF1(sK1(X0),X6)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f129,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f130,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f134,plain,
! [X0,X1] :
( rinvF1(X0,X1)
| ~ rf1(X1,X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f138,plain,
cUnsatisfiable(i2003_11_14_17_19_06193),
inference(cnf_transformation,[],[f28]) ).
fof(f139,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f140,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_56,plain,
( ~ rinvF1(sK1(X0),X1)
| ~ cUnsatisfiable(X0)
| rs(X1,sK2(X1)) ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_57,plain,
( ~ cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_58,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_59,plain,
( ~ cUnsatisfiable(X0)
| cp(sK3(X0)) ),
inference(cnf_transformation,[],[f122]) ).
cnf(c_60,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f121]) ).
cnf(c_61,plain,
( ~ rf(X0,X1)
| ~ rf(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f129]) ).
cnf(c_62,plain,
( ~ rf1(X0,X1)
| ~ rf1(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f130]) ).
cnf(c_65,plain,
( ~ rf1(X0,X1)
| rinvF1(X1,X0) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_70,plain,
cUnsatisfiable(i2003_11_14_17_19_06193),
inference(cnf_transformation,[],[f138]) ).
cnf(c_71,plain,
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f139]) ).
cnf(c_72,plain,
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f140]) ).
cnf(c_88,plain,
( ~ cp(sK1(i2003_11_14_17_19_06193))
| ~ cUnsatisfiable(i2003_11_14_17_19_06193) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_1619,plain,
( ~ cUnsatisfiable(X0)
| rinvF1(sK1(X0),X0) ),
inference(superposition,[status(thm)],[c_58,c_65]) ).
cnf(c_1647,plain,
( ~ rf(X0,X1)
| ~ cUnsatisfiable(X0)
| sK3(X0) = X1 ),
inference(superposition,[status(thm)],[c_60,c_61]) ).
cnf(c_1658,plain,
( ~ rf1(X0,X1)
| ~ cUnsatisfiable(X0)
| sK1(X0) = X1 ),
inference(superposition,[status(thm)],[c_58,c_62]) ).
cnf(c_1673,plain,
( ~ cUnsatisfiable(X0)
| rs(X0,sK2(X0)) ),
inference(superposition,[status(thm)],[c_1619,c_56]) ).
cnf(c_1683,plain,
( ~ cUnsatisfiable(X0)
| rf(X0,sK2(X0)) ),
inference(superposition,[status(thm)],[c_1673,c_72]) ).
cnf(c_1684,plain,
( ~ cUnsatisfiable(X0)
| rf1(X0,sK2(X0)) ),
inference(superposition,[status(thm)],[c_1673,c_71]) ).
cnf(c_1729,plain,
( ~ cUnsatisfiable(X0)
| sK2(X0) = sK3(X0) ),
inference(superposition,[status(thm)],[c_1683,c_1647]) ).
cnf(c_1737,plain,
sK2(i2003_11_14_17_19_06193) = sK3(i2003_11_14_17_19_06193),
inference(superposition,[status(thm)],[c_70,c_1729]) ).
cnf(c_1739,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_06193)
| cp(sK2(i2003_11_14_17_19_06193)) ),
inference(superposition,[status(thm)],[c_1737,c_59]) ).
cnf(c_1740,plain,
cp(sK2(i2003_11_14_17_19_06193)),
inference(forward_subsumption_resolution,[status(thm)],[c_1739,c_70]) ).
cnf(c_1761,plain,
( ~ cUnsatisfiable(X0)
| sK2(X0) = sK1(X0) ),
inference(superposition,[status(thm)],[c_1684,c_1658]) ).
cnf(c_1826,plain,
sK2(i2003_11_14_17_19_06193) = sK1(i2003_11_14_17_19_06193),
inference(superposition,[status(thm)],[c_70,c_1761]) ).
cnf(c_1829,plain,
cp(sK1(i2003_11_14_17_19_06193)),
inference(demodulation,[status(thm)],[c_1740,c_1826]) ).
cnf(c_1833,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1829,c_88,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS076+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 22:43:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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
% 2.22/1.20 % SZS status Started for theBenchmark.p
% 2.22/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.22/1.20
% 2.22/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.22/1.20
% 2.22/1.20 ------ iProver source info
% 2.22/1.20
% 2.22/1.20 git: date: 2024-05-02 19:28:25 +0000
% 2.22/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.22/1.20 git: non_committed_changes: false
% 2.22/1.20
% 2.22/1.20 ------ Parsing...
% 2.22/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.22/1.20
% 2.22/1.20 ------ 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.22/1.20
% 2.22/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.22/1.20
% 2.22/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.22/1.20 ------ Proving...
% 2.22/1.20 ------ Problem Properties
% 2.22/1.20
% 2.22/1.20
% 2.22/1.20 clauses 15
% 2.22/1.20 conjectures 0
% 2.22/1.20 EPR 8
% 2.22/1.20 Horn 13
% 2.22/1.20 unary 1
% 2.22/1.20 binary 8
% 2.22/1.20 lits 41
% 2.22/1.20 lits eq 3
% 2.22/1.20 fd_pure 0
% 2.22/1.20 fd_pseudo 0
% 2.22/1.20 fd_cond 0
% 2.22/1.20 fd_pseudo_cond 3
% 2.22/1.20 AC symbols 0
% 2.22/1.20
% 2.22/1.20 ------ Schedule dynamic 5 is on
% 2.22/1.20
% 2.22/1.20 ------ no conjectures: strip conj schedule
% 2.22/1.20
% 2.22/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.22/1.20
% 2.22/1.20
% 2.22/1.20 ------
% 2.22/1.20 Current options:
% 2.22/1.20 ------
% 2.22/1.20
% 2.22/1.20
% 2.22/1.20
% 2.22/1.20
% 2.22/1.20 ------ Proving...
% 2.22/1.20
% 2.22/1.20
% 2.22/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 2.22/1.20
% 2.22/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.22/1.20
% 2.22/1.20
%------------------------------------------------------------------------------