%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS077+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n023.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 : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 121 ( 8 equ)
% Maximal formula atoms : 57 ( 5 avg)
% Number of connectives : 156 ( 58 ~; 66 |; 24 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 1 sgn 23 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5,X6] :
( ( rr(X4,X5)
& rr(X4,X6) )
=> X5 = X6 )
& ? [X7] :
( rr(X4,X7)
& ! [X8] :
( rinvS(X7,X8)
=> cp(X8) ) )
& ~ cp(X4)
& ? [X7] :
( rs(X4,X7)
& cp(X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4,X7] :
( rs(X4,X7)
=> rr(X4,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_3,axiom,
! [X4,X7] :
( rinvS(X4,X7)
<=> rs(X7,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_19_09372),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_4,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5,X6] :
( ( rr(X4,X5)
& rr(X4,X6) )
=> X5 = X6 )
& ? [X7] :
( rr(X4,X7)
& ! [X8] :
( rinvS(X7,X8)
=> cp(X8) ) )
& ~ cp(X4)
& ? [X7] :
( rs(X4,X7)
& cp(X7) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
! [X83,X84,X85,X87,X89,X92,X94] :
( ( ~ rr(X83,X84)
| ~ rr(X83,X85)
| X84 = X85
| ~ cUnsatisfiable(X83) )
& ( rr(X83,esk1_1(X83))
| ~ cUnsatisfiable(X83) )
& ( ~ rinvS(esk1_1(X83),X87)
| cp(X87)
| ~ cUnsatisfiable(X83) )
& ( ~ cp(X83)
| ~ cUnsatisfiable(X83) )
& ( rs(X83,esk2_1(X83))
| ~ cUnsatisfiable(X83) )
& ( cp(esk2_1(X83))
| ~ cUnsatisfiable(X83) )
& ( rinvS(X92,esk5_2(X89,X92))
| ~ rr(X89,X92)
| rr(X89,esk3_1(X89))
| cp(X89)
| ~ rs(X89,X94)
| ~ cp(X94)
| cUnsatisfiable(X89) )
& ( ~ cp(esk5_2(X89,X92))
| ~ rr(X89,X92)
| rr(X89,esk3_1(X89))
| cp(X89)
| ~ rs(X89,X94)
| ~ cp(X94)
| cUnsatisfiable(X89) )
& ( rinvS(X92,esk5_2(X89,X92))
| ~ rr(X89,X92)
| rr(X89,esk4_1(X89))
| cp(X89)
| ~ rs(X89,X94)
| ~ cp(X94)
| cUnsatisfiable(X89) )
& ( ~ cp(esk5_2(X89,X92))
| ~ rr(X89,X92)
| rr(X89,esk4_1(X89))
| cp(X89)
| ~ rs(X89,X94)
| ~ cp(X94)
| cUnsatisfiable(X89) )
& ( rinvS(X92,esk5_2(X89,X92))
| ~ rr(X89,X92)
| esk3_1(X89) != esk4_1(X89)
| cp(X89)
| ~ rs(X89,X94)
| ~ cp(X94)
| cUnsatisfiable(X89) )
& ( ~ cp(esk5_2(X89,X92))
| ~ rr(X89,X92)
| esk3_1(X89) != esk4_1(X89)
| cp(X89)
| ~ rs(X89,X94)
| ~ cp(X94)
| cUnsatisfiable(X89) ) ),
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_4])])])])])]) ).
fof(c_0_6,plain,
! [X97,X98] :
( ~ rs(X97,X98)
| rr(X97,X98) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(c_0_7,plain,
! [X95,X96] :
( ( ~ rinvS(X95,X96)
| rs(X96,X95) )
& ( ~ rs(X96,X95)
| rinvS(X95,X96) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_8,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( rr(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( cp(X2)
| ~ rinvS(esk1_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( rinvS(X2,X1)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( X1 = esk1_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( cp(X1)
| ~ rs(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( cp(X1)
| ~ rs(X1,esk2_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( ~ cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
cUnsatisfiable(i2003_11_14_17_19_09372),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_21,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_19]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS077+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n023.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 20:37:08 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/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.373s
%------------------------------------------------------------------------------