%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS069+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 : n014.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:16 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 93 ( 10 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 105 ( 43 ~; 38 |; 18 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 58 ( 1 sgn 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf1(X4,X5)
& cp1(X5) )
& ? [X5] :
( rf2(X4,X5)
& ~ cp1(X5) )
& ? [X5] :
( rf3(X4,X5)
& cp2(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
! [X4,X5,X6] :
( ( rf2(X4,X5)
& rf2(X4,X6) )
=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_8,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf2(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_7,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_3,axiom,
! [X4,X5,X6] :
( ( rf1(X4,X5)
& rf1(X4,X6) )
=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_6,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(c_0_6,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf1(X4,X5)
& cp1(X5) )
& ? [X5] :
( rf2(X4,X5)
& ~ cp1(X5) )
& ? [X5] :
( rf3(X4,X5)
& cp2(X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_7,plain,
! [X103,X104,X105] :
( ~ rf2(X103,X104)
| ~ rf2(X103,X105)
| X104 = X105 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])]) ).
fof(c_0_8,plain,
! [X92,X96,X97,X98,X99] :
( ( rf1(X92,esk1_1(X92))
| ~ cUnsatisfiable(X92) )
& ( cp1(esk1_1(X92))
| ~ cUnsatisfiable(X92) )
& ( rf2(X92,esk2_1(X92))
| ~ cUnsatisfiable(X92) )
& ( ~ cp1(esk2_1(X92))
| ~ cUnsatisfiable(X92) )
& ( rf3(X92,esk3_1(X92))
| ~ cUnsatisfiable(X92) )
& ( cp2(esk3_1(X92))
| ~ cUnsatisfiable(X92) )
& ( ~ rf1(X96,X97)
| ~ cp1(X97)
| ~ rf2(X96,X98)
| cp1(X98)
| ~ rf3(X96,X99)
| ~ cp2(X99)
| cUnsatisfiable(X96) ) ),
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_6])])])])])]) ).
fof(c_0_9,plain,
! [X111,X112] :
( ~ rf3(X111,X112)
| rf2(X111,X112) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])]) ).
fof(c_0_10,plain,
! [X109,X110] :
( ~ rf3(X109,X110)
| rf1(X109,X110) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).
cnf(c_0_11,plain,
( X2 = X3
| ~ rf2(X1,X2)
| ~ rf2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( rf2(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( rf2(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( rf3(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X100,X101,X102] :
( ~ rf1(X100,X101)
| ~ rf1(X100,X102)
| X101 = X102 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_16,plain,
( rf1(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( X1 = esk2_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( X2 = X3
| ~ rf1(X1,X2)
| ~ rf1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( rf1(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,plain,
( ~ cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( esk2_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( X1 = esk3_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(split_conjunct,[status(thm)],[axiom_6]) ).
cnf(c_0_29,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS069+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 : n014.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:36:36 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------