%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS068+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 : n001.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.23s 1.72s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 37 ( 16 ~; 13 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> ~ cd(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X1] :
( cc(X1)
=> ! [X2] :
( rr(X1,X2)
=> cc(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_6,axiom,
! [X1] :
( ! [X2] :
( rr(X1,X2)
=> cc(X2) )
=> cd(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> cc(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_18_23845),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(c_0_5,plain,
! [X1] :
( cUnsatisfiable(X1)
=> ~ cd(X1) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_6,plain,
! [X15,X16] :
( ~ cc(X15)
| ~ rr(X15,X16)
| cc(X16) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_7,plain,
! [X17] :
( ( rr(X17,esk1_1(X17))
| cd(X17) )
& ( ~ cc(esk1_1(X17))
| cd(X17) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])]) ).
fof(c_0_8,plain,
! [X14] :
( ~ cUnsatisfiable(X14)
| ~ cd(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,plain,
( cc(X2)
| ~ cc(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( rr(X1,esk1_1(X1))
| cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( cd(X1)
| ~ cc(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X13] :
( ~ cUnsatisfiable(X13)
| cc(X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).
cnf(c_0_13,plain,
( ~ cUnsatisfiable(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( cd(X1)
| ~ cc(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
cUnsatisfiable(i2003_11_14_17_18_23845),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_17,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS068+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n001.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:03 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.23/1.72 % Version : CSE_E---1.7
% 1.23/1.72 % Problem : theBenchmark.p
% 1.23/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.72 % SZS output start CNFRefutation
% See solution above
% 1.23/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------