%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS141+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 : n023.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:42 PM UTC 2026
% Result : Theorem 1.24s 1.72s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 108 ( 49 ~; 40 |; 13 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 20 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cc(io)
& cowlThing(io) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_2,axiom,
! [X1] :
( cr(X1)
=> ! [X2] :
( rp(X1,X2)
=> cc(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
rp(ii,io),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_3,axiom,
cr(ii),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cc(io)
& cowlThing(io) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_7,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_8,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cc(io)
| ~ cowlThing(io) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cc(io)
| ~ cowlThing(io) ) ),
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,
! [X9] :
( cowlThing(X9)
& ~ cowlNothing(X9) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cc(io)
| ~ cowlThing(io) ),
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,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_13,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cc(io)
| ~ cowlThing(io) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cc(io) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11])]) ).
cnf(c_0_15,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X10] :
( ( ~ xsd_string(X10)
| ~ xsd_integer(X10) )
& ( xsd_integer(X10)
| xsd_string(X10) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
fof(c_0_17,plain,
! [X11,X12] :
( ~ cr(X11)
| ~ rp(X11,X12)
| cc(X12) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_18,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cc(io) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11])]) ).
cnf(c_0_19,negated_conjecture,
( xsd_string(esk2_0)
| ~ cc(io)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( cc(X2)
| ~ cr(X1)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
rp(ii,io),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_23,plain,
cr(ii),
inference(split_conjunct,[status(thm)],[axiom_3]) ).
cnf(c_0_24,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cc(io)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( ~ cc(io)
| ~ xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
cc(io),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
( ~ cc(io)
| ~ xsd_string(esk2_0) ),
inference(csr,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
~ xsd_integer(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
~ xsd_string(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS141+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 : n023.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:39:23 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.24/1.72 % Version : CSE_E---1.7
% 1.24/1.72 % Problem : theBenchmark.p
% 1.24/1.72 % SZS status Theorem for theBenchmark.p
% 1.24/1.72 % SZS output start CNFRefutation
% See solution above
% 1.24/1.72 % Total time : 1.374s
%------------------------------------------------------------------------------