%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS174+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 : n011.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:47 PM UTC 2026
% Result : Theorem 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 63 ( 11 unt; 0 def)
% Number of atoms : 237 ( 22 equ)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 288 ( 114 ~; 146 |; 19 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 ( 2 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( cA_and_B(X3)
<=> ( cB(X3)
| cA(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_3,axiom,
! [X3] :
( cA_and_B(X3)
<=> ( X3 = ib
| X3 = ia ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_2,axiom,
! [X3] :
( cA(X3)
<=> X3 = ia ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
! [X3] :
( cB(X3)
<=> X3 = ib ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( cA_and_B(X3)
<=> ( cB(X3)
| cA(X3) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_7,plain,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_8,negated_conjecture,
( ( ~ cB(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( cA_and_B(esk3_0)
| cB(esk3_0)
| cA(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cB(esk3_0)
| ~ cA_and_B(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk3_0)
| ~ cA_and_B(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( cA_and_B(esk3_0)
| cB(esk3_0)
| cA(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X40] :
( cowlThing(X40)
& ~ cowlNothing(X40) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ cA(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_13,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ cB(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ cA(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cA(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_16,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X41] :
( ( ~ xsd_string(X41)
| ~ xsd_integer(X41) )
& ( xsd_integer(X41)
| xsd_string(X41) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ cB(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0)
| ~ cB(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cA(esk3_0)
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11])]) ).
cnf(c_0_21,negated_conjecture,
( xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| ~ cA(esk3_0) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| ~ cB(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_11])]) ).
cnf(c_0_24,negated_conjecture,
( xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cB(esk3_0)
| ~ cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0)
| ~ cA(esk3_0) ),
inference(sr,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_27,plain,
! [X43] :
( ( ~ cA_and_B(X43)
| X43 = ib
| X43 = ia )
& ( X43 != ib
| cA_and_B(X43) )
& ( X43 != ia
| cA_and_B(X43) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
fof(c_0_28,plain,
! [X42] :
( ( ~ cA(X42)
| X42 = ia )
& ( X42 != ia
| cA(X42) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).
cnf(c_0_29,negated_conjecture,
( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cB(esk3_0)
| ~ cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
( ~ xsd_string(esk2_0)
| ~ cB(esk3_0)
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[c_0_24,c_0_22]) ).
fof(c_0_31,plain,
! [X44] :
( ( ~ cB(X44)
| X44 = ib )
& ( X44 != ib
| cB(X44) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])]) ).
cnf(c_0_32,negated_conjecture,
( cA_and_B(esk3_0)
| cB(esk3_0)
| cA(esk3_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( cA_and_B(X1)
| X1 != ia ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( cA(X1)
| X1 != ia ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,negated_conjecture,
( cA_and_B(esk3_0)
| cB(esk3_0)
| cA(esk3_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_38,negated_conjecture,
( ~ xsd_integer(esk2_0)
| ~ cB(esk3_0)
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
( cB(X1)
| X1 != ib ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,plain,
( cA_and_B(X1)
| X1 != ib ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_41,negated_conjecture,
( cA(esk3_0)
| cA_and_B(esk3_0)
| cB(esk3_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_11])]) ).
cnf(c_0_42,negated_conjecture,
( ~ cA_and_B(esk3_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_33]),c_0_34]) ).
cnf(c_0_43,plain,
( X1 = ia
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,plain,
cA_and_B(ia),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
cA(ia),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( cA(esk3_0)
| cA_and_B(esk3_0)
| cB(esk3_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_11])]) ).
cnf(c_0_47,negated_conjecture,
( ~ cB(esk3_0)
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_38]) ).
cnf(c_0_48,plain,
( X1 = ib
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_49,plain,
cB(ib),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_50,plain,
cA_and_B(ib),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_51,negated_conjecture,
( xsd_integer(esk2_0)
| cB(esk3_0)
| cA_and_B(esk3_0)
| cA(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_41,c_0_16]),c_0_33]) ).
cnf(c_0_52,negated_conjecture,
~ cA(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_53,negated_conjecture,
( xsd_string(esk2_0)
| cB(esk3_0)
| cA_and_B(esk3_0)
| cA(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_46,c_0_16]),c_0_33]) ).
cnf(c_0_54,negated_conjecture,
~ cB(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_55,negated_conjecture,
( xsd_integer(esk2_0)
| cB(esk3_0)
| cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( X1 = ib
| X1 = ia
| ~ cA_and_B(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_57,negated_conjecture,
( xsd_string(esk2_0)
| cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_53,c_0_52]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( xsd_integer(esk2_0)
| cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[c_0_55,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( esk3_0 = ia
| ~ cA_and_B(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_56]),c_0_49]),c_0_50])]) ).
cnf(c_0_60,negated_conjecture,
cA_and_B(esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_57]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
esk3_0 = ia,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_61]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS174+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.11 % 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.32 % Computer : n011.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 20:38:47 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Theorem for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.370s
%------------------------------------------------------------------------------