%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS067+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 : n018.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.20s 1.68s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 41 ( 4 avg)
% Number of connectives : 110 ( 35 ~; 57 |; 14 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ( cc(X1)
& cb(X1) )
| ( cb(X1)
& ca(X1) )
| ( cc(X1)
& ca(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X1] :
( ca(X1)
=> ~ ( cc(X1)
| cb(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_4,axiom,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_4,plain,
! [X9] :
( ( cc(X9)
| cb(X9)
| cc(X9)
| ~ cUnsatisfiable(X9) )
& ( ca(X9)
| cb(X9)
| cc(X9)
| ~ cUnsatisfiable(X9) )
& ( cc(X9)
| ca(X9)
| cc(X9)
| ~ cUnsatisfiable(X9) )
& ( ca(X9)
| ca(X9)
| cc(X9)
| ~ cUnsatisfiable(X9) )
& ( cc(X9)
| cb(X9)
| cb(X9)
| ~ cUnsatisfiable(X9) )
& ( ca(X9)
| cb(X9)
| cb(X9)
| ~ cUnsatisfiable(X9) )
& ( cc(X9)
| ca(X9)
| cb(X9)
| ~ cUnsatisfiable(X9) )
& ( ca(X9)
| ca(X9)
| cb(X9)
| ~ cUnsatisfiable(X9) )
& ( ~ cc(X9)
| ~ cb(X9)
| cUnsatisfiable(X9) )
& ( ~ cb(X9)
| ~ ca(X9)
| cUnsatisfiable(X9) )
& ( ~ cc(X9)
| ~ ca(X9)
| cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_5,plain,
( ca(X1)
| ca(X1)
| cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
( cc(X1)
| cb(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ca(X1)
| ca(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X10] :
( ( ~ cc(X10)
| ~ ca(X10) )
& ( ~ cb(X10)
| ~ ca(X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_9,plain,
( cc(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_11,plain,
( cc(X1)
| cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_13,plain,
( cb(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ cb(X1)
| ~ ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ca(i2003_11_14_17_18_1956)
| cc(i2003_11_14_17_18_1956) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
( cb(i2003_11_14_17_18_1956)
| cc(i2003_11_14_17_18_1956) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
fof(c_0_17,plain,
! [X11] :
( ~ cb(X11)
| ~ cc(X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
cnf(c_0_18,plain,
( ~ cc(X1)
| ~ ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( ca(i2003_11_14_17_18_1956)
| cb(i2003_11_14_17_18_1956) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_20,plain,
cc(i2003_11_14_17_18_1956),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
( ~ cb(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
cb(i2003_11_14_17_18_1956),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS067+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.09 % 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.11/0.29 % Computer : n018.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:36:32 EDT 2026
% 0.11/0.30 % CPUTime :
% 0.11/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
%------------------------------------------------------------------------------