%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS111+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n018.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 : Tue May 5 04:36:22 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 4 unt; 0 def)
% Number of atoms : 106 ( 10 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 120 ( 52 ~; 46 |; 15 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 2 sgn 34 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_6,axiom,
! [X4,X5,X7] :
( ( rf1(X4,X5)
& rf1(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf1(X4,X5)
& cpxcomp(X5) )
& ? [X5] :
( rs(X4,X5)
& cowlThing(X5) )
& ? [X5] :
( rf(X4,X5)
& cp(X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_13,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(axiom_5,axiom,
! [X4,X5,X7] :
( ( rf(X4,X5)
& rf(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_12,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_15425),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_8,plain,
! [X159,X160,X161] :
( ( ~ cp(X159)
| ~ ra_Px1(X159,X160) )
& ( ra_Px1(X161,esk4_1(X161))
| cp(X161) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])]) ).
fof(c_0_9,plain,
! [X163,X165,X166] :
( ( ~ cpxcomp(X163)
| ra_Px1(X163,esk5_1(X163)) )
& ( ~ ra_Px1(X165,X166)
| cpxcomp(X165) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])])]) ).
fof(c_0_10,plain,
! [X170,X171,X172] :
( ~ rf1(X170,X171)
| ~ rf1(X170,X172)
| X171 = X172 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
fof(c_0_11,plain,
! [X151,X155,X156,X157,X158] :
( ( rf1(X151,esk1_1(X151))
| ~ cUnsatisfiable(X151) )
& ( cpxcomp(esk1_1(X151))
| ~ cUnsatisfiable(X151) )
& ( rs(X151,esk2_1(X151))
| ~ cUnsatisfiable(X151) )
& ( cowlThing(esk2_1(X151))
| ~ cUnsatisfiable(X151) )
& ( rf(X151,esk3_1(X151))
| ~ cUnsatisfiable(X151) )
& ( cp(esk3_1(X151))
| ~ cUnsatisfiable(X151) )
& ( ~ rf1(X155,X156)
| ~ cpxcomp(X156)
| ~ rs(X155,X157)
| ~ cowlThing(X157)
| ~ rf(X155,X158)
| ~ cp(X158)
| cUnsatisfiable(X155) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])]) ).
fof(c_0_12,plain,
! [X184,X185] :
( ~ rs(X184,X185)
| rf1(X184,X185) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_13])]) ).
fof(c_0_13,plain,
! [X167,X168,X169] :
( ~ rf(X167,X168)
| ~ rf(X167,X169)
| X168 = X169 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(c_0_14,plain,
! [X182,X183] :
( ~ rs(X182,X183)
| rf(X182,X183) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_12])]) ).
cnf(c_0_15,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ra_Px1(X1,esk5_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( X2 = X3
| ~ rf1(X1,X2)
| ~ rf1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( rf1(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( X2 = X3
| ~ rf(X1,X2)
| ~ rf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( rf(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( ~ cpxcomp(X1)
| ~ cp(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,plain,
( cpxcomp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
( X1 = esk1_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( X1 = esk3_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( rf(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_30,plain,
( ~ cp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( ~ cp(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
cUnsatisfiable(i2003_11_14_17_21_15425),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_36,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS111+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n018.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 20:38:17 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------