%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS097+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 : n007.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:20 PM UTC 2026
% Result : Unsatisfiable 1.20s 1.68s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 73 ( 6 equ)
% Maximal formula atoms : 35 ( 4 avg)
% Number of connectives : 100 ( 44 ~; 39 |; 16 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 1 sgn 10 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] : rr(X4,X5)
& ? [X6] :
( rr(X4,X6)
& cd(X6) )
& ~ ? [X5,X7] :
( rr(X4,X5)
& rr(X4,X7)
& X5 != X7 )
& ? [X6] :
( rr(X4,X6)
& cc(X6) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4] :
~ ( cd(X4)
& cc(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_20_21603),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_3,plain,
! [X166,X169,X170,X172,X173,X174,X177] :
( ( rr(X166,esk1_1(X166))
| ~ cUnsatisfiable(X166) )
& ( rr(X166,esk2_1(X166))
| ~ cUnsatisfiable(X166) )
& ( cd(esk2_1(X166))
| ~ cUnsatisfiable(X166) )
& ( ~ rr(X166,X169)
| ~ rr(X166,X170)
| X169 = X170
| ~ cUnsatisfiable(X166) )
& ( rr(X166,esk3_1(X166))
| ~ cUnsatisfiable(X166) )
& ( cc(esk3_1(X166))
| ~ cUnsatisfiable(X166) )
& ( rr(X172,esk4_1(X172))
| ~ rr(X172,X173)
| ~ rr(X172,X174)
| ~ cd(X174)
| ~ rr(X172,X177)
| ~ cc(X177)
| cUnsatisfiable(X172) )
& ( rr(X172,esk5_1(X172))
| ~ rr(X172,X173)
| ~ rr(X172,X174)
| ~ cd(X174)
| ~ rr(X172,X177)
| ~ cc(X177)
| cUnsatisfiable(X172) )
& ( esk4_1(X172) != esk5_1(X172)
| ~ rr(X172,X173)
| ~ rr(X172,X174)
| ~ cd(X174)
| ~ rr(X172,X177)
| ~ cc(X177)
| cUnsatisfiable(X172) ) ),
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_4,plain,
! [X180] :
( ~ cd(X180)
| ~ cc(X180) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
cnf(c_0_5,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( X1 = esk3_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( ~ cc(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( esk2_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( cc(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,plain,
cUnsatisfiable(i2003_11_14_17_20_21603),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_15,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS097+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.12/0.30 % Computer : n007.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30 % CPULimit : 300
% 0.12/0.30 % WCLimit : 300
% 0.12/0.30 % DateTime : Mon May 4 20:38:38 EDT 2026
% 0.12/0.30 % CPUTime :
% 0.12/0.30 % start to proof: theBenchmark
% 1.20/1.68 % Version : CSE_E---1.7
% 1.20/1.68 % Problem : theBenchmark.p
% 1.20/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.68 % SZS output start CNFRefutation
% See solution above
% 1.20/1.68 % Total time : 1.369s
%------------------------------------------------------------------------------