TSTP Solution File: KRS082+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS082+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:33 EDT 2024
% Result : Unsatisfiable 0.87s 1.21s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 6 unt; 0 def)
% Number of atoms : 223 ( 0 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 259 ( 92 ~; 79 |; 50 &)
% ( 4 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 169 ( 4 sgn 95 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( ? [X2] :
( cowlThing(X2)
& rr(X1,X2) )
& ! [X2] :
( rp(X1,X2)
=> ! [X3] :
( rr(X2,X3)
=> cc(X3) ) )
& ! [X2] :
( rp(X1,X2)
=> ? [X3] :
( cowlThing(X3)
& rp(X2,X3) ) )
& ! [X2] :
( rp(X1,X2)
=> ? [X3] :
( cowlThing(X3)
& rr(X2,X3) ) )
& ! [X2] :
( rr(X1,X2)
=> cc(X2) )
& ? [X2] :
( cowlThing(X2)
& rp(X1,X2) )
& rs(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
! [X0] :
( cUnsatisfiable(X0)
=> ca(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
! [X0] :
( cc(X0)
<=> ! [X1] :
( rinvR(X0,X1)
=> ! [X2] :
( rinvP(X1,X2)
=> ! [X3] :
( rinvS(X2,X3)
=> ~ ca(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f6,axiom,
! [X0,X1] :
( rinvP(X0,X1)
<=> rp(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f7,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f8,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f10,axiom,
cUnsatisfiable(i2003_11_14_17_19_28752),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f11,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( ? [X2] :
( cowlThing(X2)
& rr(X1,X2) )
& ! [X3] :
( rp(X1,X3)
=> ! [X4] :
( rr(X3,X4)
=> cc(X4) ) )
& ! [X5] :
( rp(X1,X5)
=> ? [X6] :
( cowlThing(X6)
& rp(X5,X6) ) )
& ! [X7] :
( rp(X1,X7)
=> ? [X8] :
( cowlThing(X8)
& rr(X7,X8) ) )
& ! [X9] :
( rr(X1,X9)
=> cc(X9) )
& ? [X10] :
( cowlThing(X10)
& rp(X1,X10) )
& rs(X0,X1) ) ),
inference(rectify,[],[f3]) ).
fof(f12,plain,
! [X0] :
( cc(X0)
=> ! [X1] :
( rinvR(X0,X1)
=> ! [X2] :
( rinvP(X1,X2)
=> ! [X3] :
( rinvS(X2,X3)
=> ~ ca(X3) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f13,plain,
! [X0,X1] :
( rs(X1,X0)
=> rinvS(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( rp(X1,X0)
=> rinvP(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f15,plain,
! [X0,X1] :
( rr(X1,X0)
=> rinvR(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f17,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( ? [X2] : rr(X1,X2)
& ! [X3] :
( rp(X1,X3)
=> ! [X4] :
( rr(X3,X4)
=> cc(X4) ) )
& ! [X5] :
( rp(X1,X5)
=> ? [X6] : rp(X5,X6) )
& ! [X7] :
( rp(X1,X7)
=> ? [X8] : rr(X7,X8) )
& ! [X9] :
( rr(X1,X9)
=> cc(X9) )
& ? [X10] : rp(X1,X10)
& rs(X0,X1) ) ),
inference(pure_predicate_removal,[],[f11]) ).
fof(f19,plain,
! [X0] :
( ? [X1] :
( ? [X2] : rr(X1,X2)
& ! [X3] :
( ! [X4] :
( cc(X4)
| ~ rr(X3,X4) )
| ~ rp(X1,X3) )
& ! [X5] :
( ? [X6] : rp(X5,X6)
| ~ rp(X1,X5) )
& ! [X7] :
( ? [X8] : rr(X7,X8)
| ~ rp(X1,X7) )
& ! [X9] :
( cc(X9)
| ~ rr(X1,X9) )
& ? [X10] : rp(X1,X10)
& rs(X0,X1) )
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f20,plain,
! [X0] :
( ca(X0)
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ ca(X3)
| ~ rinvS(X2,X3) )
| ~ rinvP(X1,X2) )
| ~ rinvR(X0,X1) )
| ~ cc(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( rinvP(X0,X1)
| ~ rp(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f23,plain,
! [X0,X1] :
( rinvR(X0,X1)
| ~ rr(X1,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( rinvS(X0,X1)
| ~ rs(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0] :
( ? [X1] :
( ? [X2] : rr(X1,X2)
& ! [X3] :
( ! [X4] :
( cc(X4)
| ~ rr(X3,X4) )
| ~ rp(X1,X3) )
& ! [X5] :
( ? [X6] : rp(X5,X6)
| ~ rp(X1,X5) )
& ! [X7] :
( ? [X8] : rr(X7,X8)
| ~ rp(X1,X7) )
& ! [X9] :
( cc(X9)
| ~ rr(X1,X9) )
& ? [X10] : rp(X1,X10)
& rs(X0,X1) )
=> ( ? [X2] : rr(sK0(X0),X2)
& ! [X3] :
( ! [X4] :
( cc(X4)
| ~ rr(X3,X4) )
| ~ rp(sK0(X0),X3) )
& ! [X5] :
( ? [X6] : rp(X5,X6)
| ~ rp(sK0(X0),X5) )
& ! [X7] :
( ? [X8] : rr(X7,X8)
| ~ rp(sK0(X0),X7) )
& ! [X9] :
( cc(X9)
| ~ rr(sK0(X0),X9) )
& ? [X10] : rp(sK0(X0),X10)
& rs(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0] :
( ? [X2] : rr(sK0(X0),X2)
=> rr(sK0(X0),sK1(X0)) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X5] :
( ? [X6] : rp(X5,X6)
=> rp(X5,sK2(X5)) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X7] :
( ? [X8] : rr(X7,X8)
=> rr(X7,sK3(X7)) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0] :
( ? [X10] : rp(sK0(X0),X10)
=> rp(sK0(X0),sK4(X0)) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0] :
( ( rr(sK0(X0),sK1(X0))
& ! [X3] :
( ! [X4] :
( cc(X4)
| ~ rr(X3,X4) )
| ~ rp(sK0(X0),X3) )
& ! [X5] :
( rp(X5,sK2(X5))
| ~ rp(sK0(X0),X5) )
& ! [X7] :
( rr(X7,sK3(X7))
| ~ rp(sK0(X0),X7) )
& ! [X9] :
( cc(X9)
| ~ rr(sK0(X0),X9) )
& rp(sK0(X0),sK4(X0))
& rs(X0,sK0(X0)) )
| ~ cUnsatisfiable(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f19,f31,f30,f29,f28,f27]) ).
fof(f33,plain,
! [X0] :
( rs(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f34,plain,
! [X0] :
( rp(sK0(X0),sK4(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f36,plain,
! [X0,X7] :
( rr(X7,sK3(X7))
| ~ rp(sK0(X0),X7)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f38,plain,
! [X3,X0,X4] :
( cc(X4)
| ~ rr(X3,X4)
| ~ rp(sK0(X0),X3)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f40,plain,
! [X0] :
( ca(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f41,plain,
! [X2,X3,X0,X1] :
( ~ ca(X3)
| ~ rinvS(X2,X3)
| ~ rinvP(X1,X2)
| ~ rinvR(X0,X1)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f42,plain,
! [X0,X1] :
( rinvP(X0,X1)
| ~ rp(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X0,X1] :
( rinvR(X0,X1)
| ~ rr(X1,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] :
( rinvS(X0,X1)
| ~ rs(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f46,plain,
cUnsatisfiable(i2003_11_14_17_19_28752),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,plain,
( ~ rp(sK0(X0),X1)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X0)
| cc(X2) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_52,plain,
( ~ rp(sK0(X0),X1)
| ~ cUnsatisfiable(X0)
| rr(X1,sK3(X1)) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_54,plain,
( ~ cUnsatisfiable(X0)
| rp(sK0(X0),sK4(X0)) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_55,plain,
( ~ cUnsatisfiable(X0)
| rs(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_56,plain,
( ~ cUnsatisfiable(X0)
| ca(X0) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_57,plain,
( ~ rinvS(X0,X1)
| ~ rinvP(X2,X0)
| ~ rinvR(X3,X2)
| ~ cc(X3)
| ~ ca(X1) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_58,plain,
( ~ rp(X0,X1)
| rinvP(X1,X0) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_59,plain,
( ~ rr(X0,X1)
| rinvR(X1,X0) ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_60,plain,
( ~ rs(X0,X1)
| rinvS(X1,X0) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_62,plain,
cUnsatisfiable(i2003_11_14_17_19_28752),
inference(cnf_transformation,[],[f46]) ).
cnf(c_147,plain,
( ~ cUnsatisfiable(X0)
| rinvS(sK0(X0),X0) ),
inference(resolution,[status(thm)],[c_55,c_60]) ).
cnf(c_157,plain,
( ~ rinvS(X0,X1)
| ~ rinvP(X2,X0)
| ~ rinvR(X3,X2)
| ~ cUnsatisfiable(X1)
| ~ cc(X3) ),
inference(resolution,[status(thm)],[c_56,c_57]) ).
cnf(c_179,plain,
( ~ rinvP(X0,sK0(X1))
| ~ rinvR(X2,X0)
| ~ cUnsatisfiable(X1)
| ~ cc(X2) ),
inference(resolution,[status(thm)],[c_157,c_147]) ).
cnf(c_197,plain,
( ~ rp(sK0(X0),X1)
| ~ rinvR(X2,X1)
| ~ cUnsatisfiable(X0)
| ~ cc(X2) ),
inference(resolution,[status(thm)],[c_58,c_179]) ).
cnf(c_215,plain,
( ~ rp(sK0(X0),X1)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X0)
| ~ cc(X2) ),
inference(resolution,[status(thm)],[c_59,c_197]) ).
cnf(c_217,plain,
( ~ cUnsatisfiable(X0)
| ~ rr(X1,X2)
| ~ rp(sK0(X0),X1) ),
inference(global_subsumption_just,[status(thm)],[c_215,c_50,c_215]) ).
cnf(c_218,plain,
( ~ rp(sK0(X0),X1)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X0) ),
inference(renaming,[status(thm)],[c_217]) ).
cnf(c_231,plain,
( ~ rp(sK0(X0),X1)
| ~ cUnsatisfiable(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_218]) ).
cnf(c_236,plain,
~ rp(sK0(i2003_11_14_17_19_28752),X0),
inference(resolution,[status(thm)],[c_231,c_62]) ).
cnf(c_241,plain,
rp(sK0(i2003_11_14_17_19_28752),sK4(i2003_11_14_17_19_28752)),
inference(resolution,[status(thm)],[c_54,c_62]) ).
cnf(c_243,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_241,c_236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KRS082+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 22:46:50 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.87/1.21 % SZS status Started for theBenchmark.p
% 0.87/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.87/1.21
% 0.87/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.87/1.21
% 0.87/1.21 ------ iProver source info
% 0.87/1.21
% 0.87/1.21 git: date: 2024-05-02 19:28:25 +0000
% 0.87/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.87/1.21 git: non_committed_changes: false
% 0.87/1.21
% 0.87/1.21 ------ Parsing...
% 0.87/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.87/1.21
% 0.87/1.21 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s
% 0.87/1.21
% 0.87/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.87/1.21
% 0.87/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.87/1.21
% 0.87/1.21
%------------------------------------------------------------------------------