%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS072+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 : n007.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.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 88 ( 6 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 116 ( 50 ~; 46 |; 16 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 34 ( 1 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_7,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rinvR(X4,X5)
& ! [X6,X7] :
( ( rr(X5,X6)
& rr(X5,X7) )
=> X6 = X7 )
& ? [X8] :
( rr(X5,X8)
& cp1(X8) ) )
& cp2(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp3(X4)
| cp2(X4)
| cp4(X4)
| cp5(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_4,plain,
! [X102,X103] :
( ( ~ rinvR(X102,X103)
| rr(X103,X102) )
& ( ~ rr(X103,X102)
| rinvR(X102,X103) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).
fof(c_0_5,plain,
! [X88,X90,X91,X93,X94,X97] :
( ( rinvR(X88,esk1_1(X88))
| ~ cUnsatisfiable(X88) )
& ( ~ rr(esk1_1(X88),X90)
| ~ rr(esk1_1(X88),X91)
| X90 = X91
| ~ cUnsatisfiable(X88) )
& ( rr(esk1_1(X88),esk2_1(X88))
| ~ cUnsatisfiable(X88) )
& ( cp1(esk2_1(X88))
| ~ cUnsatisfiable(X88) )
& ( cp2(X88)
| ~ cUnsatisfiable(X88) )
& ( rr(X94,esk3_2(X93,X94))
| ~ rinvR(X93,X94)
| ~ rr(X94,X97)
| ~ cp1(X97)
| ~ cp2(X93)
| cUnsatisfiable(X93) )
& ( rr(X94,esk4_2(X93,X94))
| ~ rinvR(X93,X94)
| ~ rr(X94,X97)
| ~ cp1(X97)
| ~ cp2(X93)
| cUnsatisfiable(X93) )
& ( esk3_2(X93,X94) != esk4_2(X93,X94)
| ~ rinvR(X93,X94)
| ~ rr(X94,X97)
| ~ cp1(X97)
| ~ cp2(X93)
| cUnsatisfiable(X93) ) ),
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_6,plain,
! [X98] :
( ( ~ cp3(X98)
| ~ cp1(X98) )
& ( ~ cp2(X98)
| ~ cp1(X98) )
& ( ~ cp4(X98)
| ~ cp1(X98) )
& ( ~ cp5(X98)
| ~ cp1(X98) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_7,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( rinvR(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ cp2(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( X2 = X3
| ~ rr(esk1_1(X1),X2)
| ~ rr(esk1_1(X1),X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( rr(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( ~ cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( cp2(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ rr(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( ~ cUnsatisfiable(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( esk2_1(X1) = X1
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_20,plain,
~ cUnsatisfiable(X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS072+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.14/0.33 % Computer : n007.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 20:35:39 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.375s
%------------------------------------------------------------------------------