%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS152+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:01:47 PM UTC 2026
% Result : Theorem 0.08s 0.43s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 136 ( 55 ~; 43 |; 30 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 23 ( 2 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( cowlThing(iV21081)
& cC10(iV21081)
& cC12(iV21080)
& cowlThing(iV21080)
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_6,axiom,
! [X1] :
( cTEST(X1)
<=> ( ~ cC8(X1)
& cC12(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_0,axiom,
! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_2,axiom,
! [X1] :
( cC10(X1)
<=> ( cC4(X1)
& cC2(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_15,axiom,
cC4(iV21081),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).
fof(axiom_14,axiom,
cC2(iV21081),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
fof(axiom_7,axiom,
cTEST(iV21080),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_8,negated_conjecture,
~ ( cowlThing(iV21081)
& cC10(iV21081)
& cC12(iV21080)
& cowlThing(iV21080)
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_9,plain,
! [X1] :
( cTEST(X1)
<=> ( ~ cC8(X1)
& cC12(X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
fof(c_0_10,negated_conjecture,
~ ( cowlThing(iV21081)
& cC10(iV21081)
& cC12(iV21080)
& cowlThing(iV21080)
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_12,plain,
! [X5] :
( ( cC10(X5)
| ~ cC4(X5)
| ~ cC2(X5) )
& ( ~ cC10(X5)
| cC4(X5) )
& ( ~ cC10(X5)
| cC2(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
fof(c_0_13,plain,
! [X10] :
( ( cTEST(X10)
| cC8(X10)
| ~ cC12(X10) )
& ( ~ cTEST(X10)
| ~ cC8(X10) )
& ( ~ cTEST(X10)
| cC12(X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_14,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_15,negated_conjecture,
( ( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0) )
& ( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_16,plain,
! [X13] :
( ~ cowlNothing(X13)
& cowlThing(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_17,plain,
( ~ cC4(X1)
| ~ cC2(X1)
| cC10(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
cC4(iV21081),
inference(split_conjunct,[status(thm)],[axiom_15]) ).
cnf(c_0_19,plain,
cC2(iV21081),
inference(split_conjunct,[status(thm)],[axiom_14]) ).
cnf(c_0_20,plain,
( ~ cTEST(X1)
| cC12(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
cTEST(iV21080),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
fof(c_0_22,plain,
! [X12] :
( ( xsd_string(X12)
| xsd_integer(X12) )
& ( ~ xsd_integer(X12)
| ~ xsd_string(X12) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
cC10(iV21081),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_26,plain,
cC12(iV21080),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,negated_conjecture,
xsd_string(esk2_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]),c_0_28]) ).
cnf(c_0_31,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
xsd_integer(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_24]),c_0_24]),c_0_24]),c_0_30]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS152+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n010.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 22:55:25 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.43 % Version: 3.5.1
% 0.08/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.43 % Starting sh5l with 300s (1) cores
% 0.08/0.43 % new_bool_1 with pid 3690332 completed with status 0
% 0.08/0.43 % Result found by new_bool_1
% 0.08/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.43 % Search class: FGHNF-FFSM11-SFFFFFNN
% 0.08/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.43 % SubtermCWHack with pid 3690340 completed with status 0
% 0.08/0.43 % Result found by SubtermCWHack
% 0.08/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.43 % Search class: FGHNF-FFSM11-SFFFFFNN
% 0.08/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.43 % Preprocessing time : 0.001 s
% 0.08/0.43
% 0.08/0.43 % Proof found!
% 0.08/0.43 % SZS status Theorem
% 0.08/0.43 % SZS output start CNFRefutation
% See solution above
% 0.08/0.43 % Parsed axioms : 17
% 0.08/0.43 % Removed by relevancy pruning/SinE : 0
% 0.08/0.43 % Initial clauses : 30
% 0.08/0.43 % Removed in clause preprocessing : 0
% 0.08/0.43 % Initial clauses in saturation : 30
% 0.08/0.43 % Processed clauses : 44
% 0.08/0.43 % ...of these trivial : 0
% 0.08/0.43 % ...subsumed : 8
% 0.08/0.43 % ...remaining for further processing : 36
% 0.08/0.43 % Other redundant clauses eliminated : 0
% 0.08/0.43 % Clauses deleted for lack of memory : 0
% 0.08/0.43 % Backward-subsumed : 0
% 0.08/0.43 % Backward-rewritten : 2
% 0.08/0.43 % Generated clauses : 24
% 0.08/0.43 % ...of the previous two non-redundant : 14
% 0.08/0.43 % ...aggressively subsumed : 0
% 0.08/0.43 % Contextual simplify-reflections : 1
% 0.08/0.43 % Paramodulations : 24
% 0.08/0.43 % Factorizations : 0
% 0.08/0.43 % NegExts : 0
% 0.08/0.43 % Equation resolutions : 0
% 0.08/0.43 % Disequality decompositions : 0
% 0.08/0.43 % Total rewrite steps : 19
% 0.08/0.43 % ...of those cached : 12
% 0.08/0.43 % Propositional unsat checks : 0
% 0.08/0.43 % Propositional check models : 0
% 0.08/0.43 % Propositional check unsatisfiable : 0
% 0.08/0.43 % Propositional clauses : 0
% 0.08/0.43 % Propositional clauses after purity: 0
% 0.08/0.43 % Propositional unsat core size : 0
% 0.08/0.43 % Propositional preprocessing time : 0.000
% 0.08/0.43 % Propositional encoding time : 0.000
% 0.08/0.43 % Propositional solver time : 0.000
% 0.08/0.43 % Success case prop preproc time : 0.000
% 0.08/0.43 % Success case prop encoding time : 0.000
% 0.08/0.44 % Success case prop solver time : 0.000
% 0.08/0.44 % Current number of processed clauses : 34
% 0.08/0.44 % Positive orientable unit clauses : 9
% 0.08/0.44 % Positive unorientable unit clauses: 0
% 0.08/0.44 % Negative unit clauses : 4
% 0.08/0.44 % Non-unit-clauses : 21
% 0.08/0.44 % Current number of unprocessed clauses: 0
% 0.08/0.44 % ...number of literals in the above : 0
% 0.08/0.44 % Current number of archived formulas : 0
% 0.08/0.44 % Current number of archived clauses : 2
% 0.08/0.44 % Clause-clause subsumption calls (NU) : 120
% 0.08/0.44 % Rec. Clause-clause subsumption calls : 109
% 0.08/0.44 % Non-unit clause-clause subsumptions : 4
% 0.08/0.44 % Unit Clause-clause subsumption calls : 36
% 0.08/0.44 % Rewrite failures with RHS unbound : 0
% 0.08/0.44 % BW rewrite match attempts : 2
% 0.08/0.44 % BW rewrite match successes : 2
% 0.08/0.44 % Condensation attempts : 0
% 0.08/0.44 % Condensation successes : 0
% 0.08/0.44 % Termbank termtop insertions : 1763
% 0.08/0.44 % Search garbage collected termcells : 327
% 0.08/0.44
% 0.08/0.44 % -------------------------------------------------
% 0.08/0.44 % User time : 0.005 s
% 0.08/0.44 % System time : 0.003 s
% 0.08/0.44 % Total time : 0.008 s
% 0.08/0.44 % Maximum resident set size: 3640 pages
% 0.08/0.44
% 0.08/0.44 % -------------------------------------------------
% 0.08/0.44 % User time : 0.009 s
% 0.08/0.44 % System time : 0.006 s
% 0.08/0.44 % Total time : 0.015 s
% 0.08/0.44 % Maximum resident set size: 4864 pages
% 0.08/0.44 % E exiting
%------------------------------------------------------------------------------