TSTP Solution File: KRS124+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS124+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:42 EDT 2024
% Result : Unsatisfiable 0.67s 1.12s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 7 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 98 ( 39 ~; 29 |; 12 &)
% ( 6 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 4 sgn 37 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rr(X0,X1)
=> ca_Ax3(X1) )
& ? [X1] :
( cowlThing(X1)
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
! [X0] :
( cc(X0)
=> cdxcomp(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f7,axiom,
! [X0] :
( cd(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f8,axiom,
! [X0] :
( cdxcomp(X0)
<=> ? [X2] : ra_Px1(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f13,axiom,
! [X0] :
( ca_Ax3(X0)
<=> ( cc(X0)
& cd(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_22_10903),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(f15,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rr(X0,X1)
=> ca_Ax3(X1) )
& ? [X2] :
( cowlThing(X2)
& rr(X0,X2) ) ) ),
inference(rectify,[],[f3]) ).
fof(f16,plain,
! [X0] :
( cdxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f20,plain,
! [X0] :
( cdxcomp(X0)
=> ? [X1] : ra_Px1(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f21,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ! [X1] :
( rr(X0,X1)
=> ca_Ax3(X1) )
& ? [X2] :
( cowlThing(X2)
& rr(X0,X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f22,plain,
! [X0] :
( ca_Ax3(X0)
=> ( cc(X0)
& cd(X0) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f23,plain,
! [X0] :
( cd(X0)
=> ~ ? [X1] : ra_Px1(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f24,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ! [X1] :
( rr(X0,X1)
=> ca_Ax3(X1) )
& ? [X2] : rr(X0,X2) ) ),
inference(pure_predicate_removal,[],[f21]) ).
fof(f33,plain,
! [X0] :
( ( ! [X1] :
( ca_Ax3(X1)
| ~ rr(X0,X1) )
& ? [X2] : rr(X0,X2) )
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f34,plain,
! [X0] :
( cdxcomp(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f35,plain,
! [X0] :
( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cd(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f36,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
| ~ cdxcomp(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f37,plain,
! [X0] :
( ( cc(X0)
& cd(X0) )
| ~ ca_Ax3(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0] :
( ? [X2] : rr(X0,X2)
=> rr(X0,sK0(X0)) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
! [X0] :
( ( ! [X1] :
( ca_Ax3(X1)
| ~ rr(X0,X1) )
& rr(X0,sK0(X0)) )
| ~ cUnsatisfiable(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f33,f38]) ).
fof(f40,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
=> ra_Px1(X0,sK1(X0)) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0] :
( ra_Px1(X0,sK1(X0))
| ~ cdxcomp(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f36,f40]) ).
fof(f42,plain,
! [X0] :
( rr(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f43,plain,
! [X0,X1] :
( ca_Ax3(X1)
| ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f44,plain,
! [X0] :
( cdxcomp(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f45,plain,
! [X0,X1] :
( ~ ra_Px1(X0,X1)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f46,plain,
! [X0] :
( ra_Px1(X0,sK1(X0))
| ~ cdxcomp(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f47,plain,
! [X0] :
( cd(X0)
| ~ ca_Ax3(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f48,plain,
! [X0] :
( cc(X0)
| ~ ca_Ax3(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f49,plain,
cUnsatisfiable(i2003_11_14_17_22_10903),
inference(cnf_transformation,[],[f14]) ).
cnf(c_49,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| ca_Ax3(X1) ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_50,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_51,plain,
( ~ cc(X0)
| cdxcomp(X0) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_52,plain,
( ~ ra_Px1(X0,X1)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_53,plain,
( ~ cdxcomp(X0)
| ra_Px1(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_54,plain,
( ~ ca_Ax3(X0)
| cc(X0) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_55,plain,
( ~ ca_Ax3(X0)
| cd(X0) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_56,plain,
cUnsatisfiable(i2003_11_14_17_22_10903),
inference(cnf_transformation,[],[f49]) ).
cnf(c_96,plain,
( ~ cc(X0)
| ra_Px1(X0,sK1(X0)) ),
inference(resolution,[status(thm)],[c_51,c_53]) ).
cnf(c_106,plain,
( ~ ca_Ax3(X0)
| ra_Px1(X0,sK1(X0)) ),
inference(resolution,[status(thm)],[c_54,c_96]) ).
cnf(c_116,plain,
( ~ ca_Ax3(X0)
| ~ cd(X0) ),
inference(resolution,[status(thm)],[c_52,c_106]) ).
cnf(c_118,plain,
~ ca_Ax3(X0),
inference(global_subsumption_just,[status(thm)],[c_116,c_55,c_116]) ).
cnf(c_125,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_118]) ).
cnf(c_127,plain,
~ cUnsatisfiable(X0),
inference(resolution,[status(thm)],[c_125,c_50]) ).
cnf(c_128,plain,
~ cUnsatisfiable(i2003_11_14_17_22_10903),
inference(instantiation,[status(thm)],[c_127]) ).
cnf(c_129,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_128,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : KRS124+1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n014.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.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 22:30:17 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.67/1.12 % SZS status Started for theBenchmark.p
% 0.67/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.67/1.12
% 0.67/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.67/1.12
% 0.67/1.12 ------ iProver source info
% 0.67/1.12
% 0.67/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.67/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.67/1.12 git: non_committed_changes: false
% 0.67/1.12
% 0.67/1.12 ------ Parsing...
% 0.67/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.67/1.12
% 0.67/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s
% 0.67/1.12
% 0.67/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.67/1.12
% 0.67/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.67/1.12
% 0.67/1.12
%------------------------------------------------------------------------------