%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS078+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 : n001.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:18 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 124 ( 8 equ)
% Maximal formula atoms : 65 ( 6 avg)
% Number of connectives : 163 ( 59 ~; 70 |; 27 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-3 aty)
% Number of variables : 44 ( 1 sgn 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rinvR(X5,X6)
& ! [X7] :
( rs(X6,X7)
=> cp(X7) ) )
& ! [X8,X9] :
( ( rinvR(X5,X8)
& rinvR(X5,X9) )
=> X8 = X9 ) )
& ? [X5] :
( rs(X4,X5)
& ~ cq(X5)
& ~ cp(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_19_13721),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_3,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rinvR(X5,X6)
& ! [X7] :
( rs(X6,X7)
=> cp(X7) ) )
& ! [X8,X9] :
( ( rinvR(X5,X8)
& rinvR(X5,X9) )
=> X8 = X9 ) )
& ? [X5] :
( rs(X4,X5)
& ~ cq(X5)
& ~ cp(X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_4,plain,
! [X101,X102] :
( ( ~ rinvR(X101,X102)
| rr(X102,X101) )
& ( ~ rr(X102,X101)
| rinvR(X101,X102) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
fof(c_0_5,plain,
! [X87,X90,X91,X92,X94,X95,X96,X100] :
( ( rr(X87,esk1_1(X87))
| ~ cUnsatisfiable(X87) )
& ( rinvR(esk1_1(X87),esk2_1(X87))
| ~ cUnsatisfiable(X87) )
& ( ~ rs(esk2_1(X87),X90)
| cp(X90)
| ~ cUnsatisfiable(X87) )
& ( ~ rinvR(esk1_1(X87),X91)
| ~ rinvR(esk1_1(X87),X92)
| X91 = X92
| ~ cUnsatisfiable(X87) )
& ( rs(X87,esk3_1(X87))
| ~ cUnsatisfiable(X87) )
& ( ~ cq(esk3_1(X87))
| ~ cUnsatisfiable(X87) )
& ( ~ cp(esk3_1(X87))
| ~ cUnsatisfiable(X87) )
& ( rinvR(X95,esk5_2(X94,X95))
| rs(X96,esk4_3(X94,X95,X96))
| ~ rinvR(X95,X96)
| ~ rr(X94,X95)
| ~ rs(X94,X100)
| cq(X100)
| cp(X100)
| cUnsatisfiable(X94) )
& ( rinvR(X95,esk6_2(X94,X95))
| rs(X96,esk4_3(X94,X95,X96))
| ~ rinvR(X95,X96)
| ~ rr(X94,X95)
| ~ rs(X94,X100)
| cq(X100)
| cp(X100)
| cUnsatisfiable(X94) )
& ( esk5_2(X94,X95) != esk6_2(X94,X95)
| rs(X96,esk4_3(X94,X95,X96))
| ~ rinvR(X95,X96)
| ~ rr(X94,X95)
| ~ rs(X94,X100)
| cq(X100)
| cp(X100)
| cUnsatisfiable(X94) )
& ( rinvR(X95,esk5_2(X94,X95))
| ~ cp(esk4_3(X94,X95,X96))
| ~ rinvR(X95,X96)
| ~ rr(X94,X95)
| ~ rs(X94,X100)
| cq(X100)
| cp(X100)
| cUnsatisfiable(X94) )
& ( rinvR(X95,esk6_2(X94,X95))
| ~ cp(esk4_3(X94,X95,X96))
| ~ rinvR(X95,X96)
| ~ rr(X94,X95)
| ~ rs(X94,X100)
| cq(X100)
| cp(X100)
| cUnsatisfiable(X94) )
& ( esk5_2(X94,X95) != esk6_2(X94,X95)
| ~ cp(esk4_3(X94,X95,X96))
| ~ rinvR(X95,X96)
| ~ rr(X94,X95)
| ~ rs(X94,X100)
| cq(X100)
| cp(X100)
| cUnsatisfiable(X94) ) ),
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_3])])])])])]) ).
cnf(c_0_6,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X2 = X3
| ~ rinvR(esk1_1(X1),X2)
| ~ rinvR(esk1_1(X1),X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rinvR(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ rinvR(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( rinvR(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( cp(X2)
| ~ rs(esk2_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( esk2_1(X1) = X1
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( cp(X1)
| ~ rs(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( rs(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
cUnsatisfiable(i2003_11_14_17_19_13721),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_18,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS078+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.16/0.33 % Computer : n001.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:48 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % 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
%------------------------------------------------------------------------------