%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS106+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 : n020.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:21 PM UTC 2026
% Result : Unsatisfiable 1.21s 1.68s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 4 unt; 0 def)
% Number of atoms : 106 ( 11 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 119 ( 51 ~; 46 |; 15 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 2 sgn 34 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_5,axiom,
! [X4,X5,X7] :
( ( rf1(X4,X5)
& rf1(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rf3(X4,X5)
& cp2(X5) )
& ? [X5] :
( rf1(X4,X5)
& cp1(X5) )
& ? [X5] :
( rf2(X4,X5)
& cp1xcomp(X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_6,axiom,
! [X4,X5,X7] :
( ( rf2(X4,X5)
& rf2(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_10,axiom,
! [X4,X5] :
( rf3(X4,X5)
=> rf2(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cp1xcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_57644),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_8,plain,
! [X129,X130,X131] :
( ~ rf1(X129,X130)
| ~ rf1(X129,X131)
| X130 = X131 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(c_0_9,plain,
! [X113,X117,X118,X119,X120] :
( ( rf3(X113,esk1_1(X113))
| ~ cUnsatisfiable(X113) )
& ( cp2(esk1_1(X113))
| ~ cUnsatisfiable(X113) )
& ( rf1(X113,esk2_1(X113))
| ~ cUnsatisfiable(X113) )
& ( cp1(esk2_1(X113))
| ~ cUnsatisfiable(X113) )
& ( rf2(X113,esk3_1(X113))
| ~ cUnsatisfiable(X113) )
& ( cp1xcomp(esk3_1(X113))
| ~ cUnsatisfiable(X113) )
& ( ~ rf3(X117,X118)
| ~ cp2(X118)
| ~ rf1(X117,X119)
| ~ cp1(X119)
| ~ rf2(X117,X120)
| ~ cp1xcomp(X120)
| cUnsatisfiable(X117) ) ),
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_10,plain,
! [X138,X139] :
( ~ rf3(X138,X139)
| rf1(X138,X139) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])]) ).
fof(c_0_11,plain,
! [X132,X133,X134] :
( ~ rf2(X132,X133)
| ~ rf2(X132,X134)
| X133 = X134 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
fof(c_0_12,plain,
! [X140,X141] :
( ~ rf3(X140,X141)
| rf2(X140,X141) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])]) ).
fof(c_0_13,plain,
! [X121,X122,X123] :
( ( ~ cp1(X121)
| ~ ra_Px1(X121,X122) )
& ( ra_Px1(X123,esk4_1(X123))
| cp1(X123) ) ),
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_3])])])])]) ).
fof(c_0_14,plain,
! [X125,X127,X128] :
( ( ~ cp1xcomp(X125)
| ra_Px1(X125,esk5_1(X125)) )
& ( ~ ra_Px1(X127,X128)
| cp1xcomp(X127) ) ),
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_4])])])])]) ).
cnf(c_0_15,plain,
( X2 = X3
| ~ rf1(X1,X2)
| ~ rf1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( rf1(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( rf3(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( X2 = X3
| ~ rf2(X1,X2)
| ~ rf2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( rf2(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ra_Px1(X1,esk5_1(X1))
| ~ cp1xcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( X1 = esk2_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( X1 = esk3_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( rf2(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_28,plain,
( ~ cp1xcomp(X1)
| ~ cp1(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( cp1xcomp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( esk1_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
cUnsatisfiable(i2003_11_14_17_20_57644),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_36,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS106+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.09 % 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.11/0.29 % Computer : n020.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Mon May 4 20:37:34 EDT 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.30 % start to proof: theBenchmark
% 1.21/1.68 % Version : CSE_E---1.7
% 1.21/1.68 % Problem : theBenchmark.p
% 1.21/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.68 % SZS output start CNFRefutation
% See solution above
% 1.21/1.68 % Total time : 1.374s
%------------------------------------------------------------------------------