%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS088+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 : n031.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.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 76 ( 6 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 93 ( 39 ~; 35 |; 13 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 44 ( 1 sgn 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ? [X5] :
( rf(X4,X5)
& ! [X6] :
( rinvF(X5,X6)
=> ? [X7] :
( rf(X6,X7)
& ~ cp1(X7) ) )
& cp1(X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
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_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_49673),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_4,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ? [X5] :
( rf(X4,X5)
& ! [X6] :
( rinvF(X5,X6)
=> ? [X7] :
( rf(X6,X7)
& ~ cp1(X7) ) )
& cp1(X5) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
! [X98,X100,X102,X103,X105] :
( ( rf(X98,esk1_1(X98))
| ~ cUnsatisfiable(X98) )
& ( rf(X100,esk2_2(X98,X100))
| ~ rinvF(esk1_1(X98),X100)
| ~ cUnsatisfiable(X98) )
& ( ~ cp1(esk2_2(X98,X100))
| ~ rinvF(esk1_1(X98),X100)
| ~ cUnsatisfiable(X98) )
& ( cp1(esk1_1(X98))
| ~ cUnsatisfiable(X98) )
& ( rinvF(X103,esk3_2(X102,X103))
| ~ rf(X102,X103)
| ~ cp1(X103)
| cUnsatisfiable(X102) )
& ( ~ rf(esk3_2(X102,X103),X105)
| cp1(X105)
| ~ rf(X102,X103)
| ~ cp1(X103)
| 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_6,plain,
! [X109,X110] :
( ( ~ rinvF(X109,X110)
| rf(X110,X109) )
& ( ~ rf(X110,X109)
| rinvF(X109,X110) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])]) ).
fof(c_0_7,plain,
! [X106,X107,X108] :
( ~ rf(X106,X107)
| ~ rf(X106,X108)
| X107 = X108 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_8,plain,
( rf(X1,esk2_2(X2,X1))
| ~ rinvF(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rinvF(X2,X1)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X2 = X3
| ~ rf(X1,X2)
| ~ rf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( rf(X1,esk2_2(X2,X1))
| ~ rf(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( X1 = esk2_2(X2,X3)
| ~ rf(X3,esk1_1(X2))
| ~ rf(X3,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( X1 = esk2_2(X2,X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( ~ cp1(esk2_2(X1,X2))
| ~ rinvF(esk1_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( esk2_2(X1,X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( ~ rinvF(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
cUnsatisfiable(i2003_11_14_17_19_49673),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_20,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_9]),c_0_13]) ).
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 : KRS088+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 : n031.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:38:53 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/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.369s
%------------------------------------------------------------------------------