%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS105+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 : n027.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.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 30 ~; 26 |; 4 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 39 ( 1 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_5,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_6,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cdxcomp(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_8,axiom,
! [X1] :
( ca_Ax2(X1)
=> cd(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_4,axiom,
! [X1] :
( cc(X1)
=> ! [X2] :
( rr(X1,X2)
=> cc(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_7,axiom,
! [X1] :
( ca_Ax2(X1)
<=> ! [X2] :
( rr(X1,X2)
=> cc(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_3,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cc(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_9,axiom,
cUnsatisfiable(i2003_11_14_17_20_53634),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(c_0_8,plain,
! [X23,X24,X25] :
( ( ~ cd(X23)
| ~ ra_Px1(X23,X24) )
& ( ra_Px1(X25,esk1_1(X25))
| cd(X25) ) ),
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_5])])])])]) ).
fof(c_0_9,plain,
! [X27,X29,X30] :
( ( ~ cdxcomp(X27)
| ra_Px1(X27,esk2_1(X27)) )
& ( ~ ra_Px1(X29,X30)
| cdxcomp(X29) ) ),
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_6])])])])]) ).
cnf(c_0_10,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X19] :
( ~ cUnsatisfiable(X19)
| cdxcomp(X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).
cnf(c_0_13,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( cdxcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X35] :
( ~ ca_Ax2(X35)
| cd(X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])]) ).
cnf(c_0_16,plain,
( ~ cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( cd(X1)
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X21,X22] :
( ~ cc(X21)
| ~ rr(X21,X22)
| cc(X22) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_19,plain,
! [X31,X32,X33] :
( ( ~ ca_Ax2(X31)
| ~ rr(X31,X32)
| cc(X32) )
& ( rr(X33,esk3_1(X33))
| ca_Ax2(X33) )
& ( ~ cc(esk3_1(X33))
| ca_Ax2(X33) ) ),
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_7])])])])])]) ).
fof(c_0_20,plain,
! [X20] :
( ~ cUnsatisfiable(X20)
| cc(X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_21,plain,
( ~ ca_Ax2(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
cUnsatisfiable(i2003_11_14_17_20_53634),
inference(split_conjunct,[status(thm)],[axiom_9]) ).
cnf(c_0_23,plain,
( cc(X2)
| ~ cc(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( rr(X1,esk3_1(X1))
| ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ca_Ax2(X1)
| ~ cc(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
~ ca_Ax2(i2003_11_14_17_20_53634),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ca_Ax2(X1)
| ~ cc(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
cc(i2003_11_14_17_20_53634),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_30,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS105+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 : n027.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:37:34 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/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.374s
%------------------------------------------------------------------------------