%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS087+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 : n028.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:19 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 92 ( 37 ~; 33 |; 16 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 39 ( 1 sgn 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4,X5,X6] :
( ( rr(X4,X5)
& rr(X5,X6) )
=> rr(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_46763),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_4,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6) ) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
! [X113,X114,X115] :
( ~ rr(X113,X114)
| ~ rr(X114,X115)
| rr(X113,X115) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
fof(c_0_6,plain,
! [X98,X101,X102,X103,X104] :
( ( cp1(X98)
| ~ cUnsatisfiable(X98) )
& ( rr(X98,esk1_1(X98))
| ~ cUnsatisfiable(X98) )
& ( rr(esk1_1(X98),esk2_1(X98))
| ~ cUnsatisfiable(X98) )
& ( ~ rinvR(esk2_1(X98),X101)
| ~ cp1(X101)
| ~ cUnsatisfiable(X98) )
& ( cp1(esk2_1(X98))
| ~ cUnsatisfiable(X98) )
& ( rinvR(X104,esk3_3(X102,X103,X104))
| ~ rr(X103,X104)
| ~ cp1(X104)
| ~ rr(X102,X103)
| ~ cp1(X102)
| cUnsatisfiable(X102) )
& ( cp1(esk3_3(X102,X103,X104))
| ~ rr(X103,X104)
| ~ cp1(X104)
| ~ rr(X102,X103)
| ~ cp1(X102)
| cUnsatisfiable(X102) ) ),
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_7,plain,
! [X111,X112] :
( ( ~ rinvR(X111,X112)
| rr(X112,X111) )
& ( ~ rr(X112,X111)
| rinvR(X111,X112) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
cnf(c_0_8,plain,
( rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ rinvR(esk2_1(X1),X2)
| ~ cp1(X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( rr(X1,esk2_1(X2))
| ~ rr(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ rr(X1,esk2_1(X2))
| ~ cp1(X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
cUnsatisfiable(i2003_11_14_17_19_46763),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
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 : KRS087+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.15/0.32 % Computer : n028.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 20:37:01 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.372s
%------------------------------------------------------------------------------