%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS100+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:20 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 41 ( 6 avg)
% Number of connectives : 97 ( 34 ~; 42 |; 15 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 22 ( 1 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ! [X2] :
( rr(X1,X2)
=> ( ce(X2)
| ~ cd(X2) ) )
& ! [X2] :
( rr(X1,X2)
=> cd(X2) )
& ? [X2] :
( rr(X1,X2)
& ~ ce(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_20_32704),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_2,plain,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ! [X2] :
( rr(X1,X2)
=> ( ce(X2)
| ~ cd(X2) ) )
& ! [X2] :
( rr(X1,X2)
=> cd(X2) )
& ? [X2] :
( rr(X1,X2)
& ~ ce(X2) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_3,plain,
! [X12,X13,X14,X16,X19] :
( ( ~ rr(X12,X13)
| ce(X13)
| ~ cd(X13)
| ~ cUnsatisfiable(X12) )
& ( ~ rr(X12,X14)
| cd(X14)
| ~ cUnsatisfiable(X12) )
& ( rr(X12,esk1_1(X12))
| ~ cUnsatisfiable(X12) )
& ( ~ ce(esk1_1(X12))
| ~ cUnsatisfiable(X12) )
& ( rr(X16,esk3_1(X16))
| rr(X16,esk2_1(X16))
| ~ rr(X16,X19)
| ce(X19)
| cUnsatisfiable(X16) )
& ( ~ cd(esk3_1(X16))
| rr(X16,esk2_1(X16))
| ~ rr(X16,X19)
| ce(X19)
| cUnsatisfiable(X16) )
& ( rr(X16,esk3_1(X16))
| ~ ce(esk2_1(X16))
| ~ rr(X16,X19)
| ce(X19)
| cUnsatisfiable(X16) )
& ( ~ cd(esk3_1(X16))
| ~ ce(esk2_1(X16))
| ~ rr(X16,X19)
| ce(X19)
| cUnsatisfiable(X16) )
& ( rr(X16,esk3_1(X16))
| cd(esk2_1(X16))
| ~ rr(X16,X19)
| ce(X19)
| cUnsatisfiable(X16) )
& ( ~ cd(esk3_1(X16))
| cd(esk2_1(X16))
| ~ rr(X16,X19)
| ce(X19)
| cUnsatisfiable(X16) ) ),
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_2])])])])])]) ).
cnf(c_0_4,plain,
( ce(X2)
| ~ rr(X1,X2)
| ~ cd(X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
( cd(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( ce(X1)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(csr,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( ~ ce(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
cUnsatisfiable(i2003_11_14_17_20_32704),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_10,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS100+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 : n027.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:37:20 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/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.373s
%------------------------------------------------------------------------------