%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS091+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 : n008.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:19 PM UTC 2026
% Result : Unsatisfiable 0.22s 1.61s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 6 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 79 ( 38 ~; 24 |; 7 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 33 ( 1 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_4,axiom,
! [X1] :
( cc1(X1)
=> ~ cd1(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X1] :
( cc(X1)
=> ~ cd(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( cd(X1)
& cc(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X1] :
( cc1(X1)
=> cd1(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_6,axiom,
! [X1] :
( ce3(X1)
=> cc(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_7,axiom,
! [X1] :
( cf(X1)
=> cd(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_00819),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(i_0_9,plain,
! [X1] :
( cc1(X1)
=> ~ cd1(X1) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
fof(i_0_10,plain,
! [X1] :
( cc(X1)
=> ~ cd(X1) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(i_0_11,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(i_0_12,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(i_0_13,plain,
! [X12] :
( ( cd(X12)
| ~ cUnsatisfiable(X12) )
& ( cc(X12)
| ~ cUnsatisfiable(X12) )
& ( ~ cd(X12)
| ~ cc(X12)
| cUnsatisfiable(X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
fof(i_0_14,plain,
! [X14] :
( ~ cc1(X14)
| ~ cd1(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_9])]) ).
fof(i_0_15,plain,
! [X13] :
( ~ cc(X13)
| ~ cd(X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_10])]) ).
fof(i_0_16,plain,
! [X11] :
( ( ~ xsd_string(X11)
| ~ xsd_integer(X11) )
& ( xsd_integer(X11)
| xsd_string(X11) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_11])]) ).
fof(i_0_17,plain,
! [X15] :
( ~ cc1(X15)
| cd1(X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(i_0_18,plain,
! [X16] :
( ~ ce3(X16)
| cc(X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
fof(i_0_19,plain,
! [X17] :
( ~ cf(X17)
| cd(X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).
fof(i_0_20,plain,
! [X10] :
( cowlThing(X10)
& ~ cowlNothing(X10) ),
inference(variable_rename,[status(thm)],[i_0_12]) ).
cnf(i_0_21,plain,
( cUnsatisfiable(X1)
| ~ cd(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_22,plain,
( ~ cc1(X1)
| ~ cd1(X1) ),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_23,plain,
( ~ cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[i_0_15]),
[final] ).
cnf(i_0_24,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[i_0_16]),
[final] ).
cnf(i_0_25,plain,
( cd1(X1)
| ~ cc1(X1) ),
inference(split_conjunct,[status(thm)],[i_0_17]),
[final] ).
cnf(i_0_26,plain,
( cc(X1)
| ~ ce3(X1) ),
inference(split_conjunct,[status(thm)],[i_0_18]),
[final] ).
cnf(i_0_27,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_28,plain,
( cd(X1)
| ~ cf(X1) ),
inference(split_conjunct,[status(thm)],[i_0_19]),
[final] ).
cnf(i_0_29,plain,
( cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_30,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[i_0_16]),
[final] ).
cnf(i_0_31,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[i_0_20]),
[final] ).
cnf(i_0_32,plain,
cUnsatisfiable(i2003_11_14_17_20_00819),
inference(split_conjunct,[status(thm)],[axiom_8]),
[final] ).
cnf(i_0_33,plain,
cc(i2003_11_14_17_20_00819),
inference(scs_inference,[],[i_0_32,i_0_27]) ).
cnf(i_0_34,plain,
( ~ cUnsatisfiable(X1)
| cc(X1) ),
inference(rename_variables,[],[i_0_27]) ).
cnf(i_0_35,plain,
cd(i2003_11_14_17_20_00819),
inference(scs_inference,[],[i_0_32,i_0_27,i_0_29]) ).
cnf(i_0_36,plain,
( ~ cUnsatisfiable(X1)
| cd(X1) ),
inference(rename_variables,[],[i_0_29]) ).
cnf(i_0_37,plain,
$false,
inference(scs_inference,[],[i_0_32,i_0_27,i_0_29,i_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS091+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n008.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 20:36:58 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 0.22/1.61 % Version : CSE_E---1.7
% 0.22/1.61 % Problem : theBenchmark.p
% 0.22/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.22/1.61 % SZS output start CNFRefutation
% See solution above
% 0.22/1.63 % Total time : 1.270s
%------------------------------------------------------------------------------