%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS073+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 : 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 : Tue May 5 04:36:17 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 119 ( 6 equ)
% Maximal formula atoms : 35 ( 3 avg)
% Number of connectives : 144 ( 56 ~; 59 |; 19 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 63 ( 1 sgn 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf(X4,X5)
& ! [X6] :
( rinvS(X5,X6)
=> cp(X6) )
& ! [X6] :
( rinvF(X5,X6)
=> ? [X7] :
( rs(X6,X7)
& cp(X7) ) ) )
& ~ cp(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_11,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rf(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(axiom_3,axiom,
! [X4,X5,X6] :
( ( rf(X4,X5)
& rf(X4,X6) )
=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
! [X4,X5] :
( rinvS(X4,X5)
<=> rs(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_9,axiom,
cUnsatisfiable(i2003_11_14_17_18_54369),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(c_0_6,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf(X4,X5)
& ! [X6] :
( rinvS(X5,X6)
=> cp(X6) )
& ! [X6] :
( rinvF(X5,X6)
=> ? [X7] :
( rs(X6,X7)
& cp(X7) ) ) )
& ~ cp(X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_7,plain,
! [X159,X160] :
( ~ rs(X159,X160)
| rf(X159,X160) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_11])]) ).
fof(c_0_8,plain,
! [X132,X134,X135,X137,X138,X141] :
( ( rf(X132,esk1_1(X132))
| ~ cUnsatisfiable(X132) )
& ( ~ rinvS(esk1_1(X132),X134)
| cp(X134)
| ~ cUnsatisfiable(X132) )
& ( rs(X135,esk2_2(X132,X135))
| ~ rinvF(esk1_1(X132),X135)
| ~ cUnsatisfiable(X132) )
& ( cp(esk2_2(X132,X135))
| ~ rinvF(esk1_1(X132),X135)
| ~ cUnsatisfiable(X132) )
& ( ~ cp(X132)
| ~ cUnsatisfiable(X132) )
& ( rinvF(X138,esk4_2(X137,X138))
| rinvS(X138,esk3_2(X137,X138))
| ~ rf(X137,X138)
| cp(X137)
| cUnsatisfiable(X137) )
& ( ~ rs(esk4_2(X137,X138),X141)
| ~ cp(X141)
| rinvS(X138,esk3_2(X137,X138))
| ~ rf(X137,X138)
| cp(X137)
| cUnsatisfiable(X137) )
& ( rinvF(X138,esk4_2(X137,X138))
| ~ cp(esk3_2(X137,X138))
| ~ rf(X137,X138)
| cp(X137)
| cUnsatisfiable(X137) )
& ( ~ rs(esk4_2(X137,X138),X141)
| ~ cp(X141)
| ~ cp(esk3_2(X137,X138))
| ~ rf(X137,X138)
| cp(X137)
| cUnsatisfiable(X137) ) ),
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)],[c_0_6])])])])])]) ).
fof(c_0_9,plain,
! [X142,X143,X144] :
( ~ rf(X142,X143)
| ~ rf(X142,X144)
| X143 = X144 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_10,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( rs(X1,esk2_2(X2,X1))
| ~ rinvF(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X148,X149] :
( ( ~ rinvF(X148,X149)
| rf(X149,X148) )
& ( ~ rf(X149,X148)
| rinvF(X148,X149) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
cnf(c_0_13,plain,
( X2 = X3
| ~ rf(X1,X2)
| ~ rf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( rf(X1,esk2_2(X2,X1))
| ~ rinvF(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( rinvF(X2,X1)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( X1 = esk1_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( rf(X1,esk2_2(X2,X1))
| ~ rf(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( esk2_2(X1,X2) = esk1_1(X2)
| ~ rf(X2,esk1_1(X1))
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_20,plain,
! [X152,X153] :
( ( ~ rinvS(X152,X153)
| rs(X153,X152) )
& ( ~ rs(X153,X152)
| rinvS(X152,X153) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).
cnf(c_0_21,plain,
( esk2_2(X1,X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_22,plain,
( cp(X2)
| ~ rinvS(esk1_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
( rinvS(X2,X1)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( rs(X1,esk1_1(X1))
| ~ rinvF(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_25,plain,
( cp(X1)
| ~ rs(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_14]) ).
cnf(c_0_27,plain,
( ~ cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
inference(split_conjunct,[status(thm)],[axiom_9]) ).
cnf(c_0_29,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS073+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 : n003.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:36:11 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.367s
%------------------------------------------------------------------------------