TSTP Solution File: KRS128+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS128+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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.77s 1.17s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 5 unt; 0 def)
% Number of atoms : 139 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 148 ( 56 ~; 49 |; 25 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 75 ( 1 sgn 45 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rr(X0,X1)
=> ca_Cx4(X1) )
& ! [X1] :
( rr(X0,X1)
=> cd(X1) )
& ? [X1] :
( cexcomp(X1)
& rr(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f9,axiom,
! [X0] :
( ca_Cx4(X0)
<=> ? [X2] : ra_Px4(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f10,axiom,
! [X0] :
( ca_Cx4xcomp(X0)
<=> ~ ? [X1] : ra_Px4(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f11,axiom,
! [X0] :
( ca_Cx4xcomp(X0)
<=> ( cexcomp(X0)
& cd(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(f12,axiom,
cUnsatisfiable(i2003_11_14_17_22_31584),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f13,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1] :
( rr(X0,X1)
=> ca_Cx4(X1) )
& ! [X2] :
( rr(X0,X2)
=> cd(X2) )
& ? [X3] :
( cexcomp(X3)
& rr(X0,X3) ) ) ),
inference(rectify,[],[f3]) ).
fof(f16,plain,
! [X0] :
( ca_Cx4(X0)
<=> ? [X1] : ra_Px4(X0,X1) ),
inference(rectify,[],[f9]) ).
fof(f18,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ! [X1] :
( rr(X0,X1)
=> ca_Cx4(X1) )
& ! [X2] :
( rr(X0,X2)
=> cd(X2) )
& ? [X3] :
( cexcomp(X3)
& rr(X0,X3) ) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f19,plain,
! [X0] :
( ca_Cx4(X0)
=> ? [X1] : ra_Px4(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f24,plain,
! [X0] :
( ( ! [X1] :
( ca_Cx4(X1)
| ~ rr(X0,X1) )
& ! [X2] :
( cd(X2)
| ~ rr(X0,X2) )
& ? [X3] :
( cexcomp(X3)
& rr(X0,X3) ) )
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f25,plain,
! [X0] :
( ? [X1] : ra_Px4(X0,X1)
| ~ ca_Cx4(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f26,plain,
! [X0] :
( ca_Cx4xcomp(X0)
<=> ! [X1] : ~ ra_Px4(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f27,plain,
! [X0] :
( ? [X3] :
( cexcomp(X3)
& rr(X0,X3) )
=> ( cexcomp(sK0(X0))
& rr(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0] :
( ( ! [X1] :
( ca_Cx4(X1)
| ~ rr(X0,X1) )
& ! [X2] :
( cd(X2)
| ~ rr(X0,X2) )
& cexcomp(sK0(X0))
& rr(X0,sK0(X0)) )
| ~ cUnsatisfiable(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f24,f27]) ).
fof(f37,plain,
! [X0] :
( ? [X1] : ra_Px4(X0,X1)
=> ra_Px4(X0,sK3(X0)) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0] :
( ra_Px4(X0,sK3(X0))
| ~ ca_Cx4(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f25,f37]) ).
fof(f39,plain,
! [X0] :
( ( ca_Cx4xcomp(X0)
| ? [X1] : ra_Px4(X0,X1) )
& ( ! [X1] : ~ ra_Px4(X0,X1)
| ~ ca_Cx4xcomp(X0) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f40,plain,
! [X0] :
( ( ca_Cx4xcomp(X0)
| ? [X1] : ra_Px4(X0,X1) )
& ( ! [X2] : ~ ra_Px4(X0,X2)
| ~ ca_Cx4xcomp(X0) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0] :
( ? [X1] : ra_Px4(X0,X1)
=> ra_Px4(X0,sK4(X0)) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0] :
( ( ca_Cx4xcomp(X0)
| ra_Px4(X0,sK4(X0)) )
& ( ! [X2] : ~ ra_Px4(X0,X2)
| ~ ca_Cx4xcomp(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f40,f41]) ).
fof(f43,plain,
! [X0] :
( ( ca_Cx4xcomp(X0)
| ~ cexcomp(X0)
| ~ cd(X0) )
& ( ( cexcomp(X0)
& cd(X0) )
| ~ ca_Cx4xcomp(X0) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f44,plain,
! [X0] :
( ( ca_Cx4xcomp(X0)
| ~ cexcomp(X0)
| ~ cd(X0) )
& ( ( cexcomp(X0)
& cd(X0) )
| ~ ca_Cx4xcomp(X0) ) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
! [X0] :
( rr(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f46,plain,
! [X0] :
( cexcomp(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f47,plain,
! [X2,X0] :
( cd(X2)
| ~ rr(X0,X2)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f48,plain,
! [X0,X1] :
( ca_Cx4(X1)
| ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f53,plain,
! [X0] :
( ra_Px4(X0,sK3(X0))
| ~ ca_Cx4(X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f54,plain,
! [X2,X0] :
( ~ ra_Px4(X0,X2)
| ~ ca_Cx4xcomp(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f58,plain,
! [X0] :
( ca_Cx4xcomp(X0)
| ~ cexcomp(X0)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f59,plain,
cUnsatisfiable(i2003_11_14_17_22_31584),
inference(cnf_transformation,[],[f12]) ).
cnf(c_49,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| ca_Cx4(X1) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_50,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| cd(X1) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_51,plain,
( ~ cUnsatisfiable(X0)
| cexcomp(sK0(X0)) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_52,plain,
( ~ cUnsatisfiable(X0)
| rr(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_57,plain,
( ~ ca_Cx4(X0)
| ra_Px4(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_59,plain,
( ~ ra_Px4(X0,X1)
| ~ ca_Cx4xcomp(X0) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_60,plain,
( ~ cd(X0)
| ~ cexcomp(X0)
| ca_Cx4xcomp(X0) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_63,plain,
cUnsatisfiable(i2003_11_14_17_22_31584),
inference(cnf_transformation,[],[f59]) ).
cnf(c_69,plain,
( ~ cUnsatisfiable(i2003_11_14_17_22_31584)
| cexcomp(sK0(i2003_11_14_17_22_31584)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_144,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| ra_Px4(X1,sK3(X1)) ),
inference(resolution,[status(thm)],[c_57,c_49]) ).
cnf(c_158,plain,
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| ~ ca_Cx4xcomp(X1) ),
inference(resolution,[status(thm)],[c_144,c_59]) ).
cnf(c_173,plain,
( ~ ca_Cx4xcomp(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[status(thm)],[c_158,c_52]) ).
cnf(c_174,plain,
( ~ ca_Cx4xcomp(sK0(i2003_11_14_17_22_31584))
| ~ cUnsatisfiable(i2003_11_14_17_22_31584) ),
inference(instantiation,[status(thm)],[c_173]) ).
cnf(c_181,plain,
( ~ cUnsatisfiable(X0)
| cd(sK0(X0)) ),
inference(resolution,[status(thm)],[c_50,c_52]) ).
cnf(c_193,plain,
cd(sK0(i2003_11_14_17_22_31584)),
inference(resolution,[status(thm)],[c_181,c_63]) ).
cnf(c_209,plain,
( ~ cexcomp(sK0(i2003_11_14_17_22_31584))
| ca_Cx4xcomp(sK0(i2003_11_14_17_22_31584)) ),
inference(resolution,[status(thm)],[c_60,c_193]) ).
cnf(c_210,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_209,c_174,c_69,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS128+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n019.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:59 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/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
% 0.77/1.17 % SZS status Started for theBenchmark.p
% 0.77/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.77/1.17
% 0.77/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.77/1.17
% 0.77/1.17 ------ iProver source info
% 0.77/1.17
% 0.77/1.17 git: date: 2024-05-02 19:28:25 +0000
% 0.77/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.77/1.17 git: non_committed_changes: false
% 0.77/1.17
% 0.77/1.17 ------ Parsing...
% 0.77/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.77/1.17
% 0.77/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s
% 0.77/1.17
% 0.77/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.77/1.17
% 0.77/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.77/1.17
% 0.77/1.17
%------------------------------------------------------------------------------