%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS160+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 : n012.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:03 PM UTC 2026
% Result : Theorem 0.07s 0.35s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 146 ( 59 ~; 51 |; 29 &)
% ( 7 <=>; 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 : 22 ( 2 sgn 16 !; 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_0,axiom,
! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_2,axiom,
! [X1] :
( cC10(X1)
<=> ( cC2(X1)
& cC4(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_12,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC12(X1)
& cC8xcomp(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_20,axiom,
cC2(iV21081),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_20) ).
fof(axiom_18,axiom,
cC4(iV21081),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_18) ).
fof(axiom_13,axiom,
cTEST(iV21080),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
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,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_10,plain,
! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_11,negated_conjecture,
( ( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| cowlNothing(esk9_0)
| ~ cowlThing(esk9_0)
| ~ xsd_integer(esk10_0)
| xsd_string(esk10_0) )
& ( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| cowlNothing(esk9_0)
| ~ cowlThing(esk9_0)
| xsd_integer(esk10_0)
| ~ xsd_string(esk10_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_9])])])])]) ).
fof(c_0_12,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_13,plain,
! [X6] :
( ( cC10(X6)
| ~ cC2(X6)
| ~ cC4(X6) )
& ( ~ cC10(X6)
| cC2(X6) )
& ( ~ cC10(X6)
| cC4(X6) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
fof(c_0_14,plain,
! [X40] :
( ( cTEST(X40)
| ~ cC12(X40)
| ~ cC8xcomp(X40) )
& ( ~ cTEST(X40)
| cC12(X40) )
& ( ~ cTEST(X40)
| cC8xcomp(X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_12])])])]) ).
fof(c_0_15,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_16,negated_conjecture,
( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk9_0)
| ~ xsd_integer(esk10_0)
| cowlNothing(esk9_0)
| xsd_string(esk10_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ cC2(X1)
| ~ cC4(X1)
| cC10(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
cC2(iV21081),
inference(split_conjunct,[status(thm)],[axiom_20]) ).
cnf(c_0_20,plain,
cC4(iV21081),
inference(split_conjunct,[status(thm)],[axiom_18]) ).
cnf(c_0_21,plain,
( ~ cTEST(X1)
| cC12(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
cTEST(iV21080),
inference(split_conjunct,[status(thm)],[axiom_13]) ).
fof(c_0_23,plain,
! [X5] :
( ( xsd_string(X5)
| xsd_integer(X5) )
& ( ~ xsd_integer(X5)
| ~ xsd_string(X5) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk9_0)
| ~ xsd_string(esk10_0)
| cowlNothing(esk9_0)
| xsd_integer(esk10_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_integer(esk10_0)
| xsd_string(esk10_0)
| cowlNothing(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17])]) ).
cnf(c_0_26,plain,
cC10(iV21081),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_27,plain,
cC12(iV21080),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_string(esk10_0)
| xsd_integer(esk10_0)
| cowlNothing(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17]),c_0_17]),c_0_17])]) ).
cnf(c_0_31,negated_conjecture,
xsd_string(esk10_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,negated_conjecture,
xsd_integer(esk10_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KRS160+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Sun Sep 20 22:54:52 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.35 % Version: 3.5.1
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.35 % Starting sh5l with 300s (1) cores
% 0.07/0.35 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1037383 completed with status 0
% 0.07/0.35 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.35 % No SInE strategy applied
% 0.07/0.35 % Search class: FGHNF-FFSM11-SFFFFFNN
% 0.07/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.07/0.35 % Starting new_bool_3 with 136s (1) cores
% 0.07/0.35 % Starting new_bool_1 with 136s (1) cores
% 0.07/0.35 % SubtermCWHack with pid 1037387 completed with status 0
% 0.07/0.35 % Result found by SubtermCWHack
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.35 % No SInE strategy applied
% 0.07/0.35 % Search class: FGHNF-FFSM11-SFFFFFNN
% 0.07/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.35 % Preprocessing time : 0.001 s
% 0.07/0.35
% 0.07/0.35 % Proof found!
% 0.07/0.35 % SZS status Theorem
% 0.07/0.35 % SZS output start CNFRefutation
% See solution above
% 0.07/0.35 % Parsed axioms : 23
% 0.07/0.35 % Removed by relevancy pruning/SinE : 0
% 0.07/0.35 % Initial clauses : 42
% 0.07/0.35 % Removed in clause preprocessing : 3
% 0.07/0.35 % Initial clauses in saturation : 39
% 0.07/0.35 % Processed clauses : 44
% 0.07/0.35 % ...of these trivial : 0
% 0.07/0.35 % ...subsumed : 0
% 0.07/0.35 % ...remaining for further processing : 44
% 0.07/0.35 % Other redundant clauses eliminated : 0
% 0.07/0.35 % Clauses deleted for lack of memory : 0
% 0.07/0.35 % Backward-subsumed : 0
% 0.07/0.35 % Backward-rewritten : 0
% 0.07/0.35 % Generated clauses : 24
% 0.07/0.35 % ...of the previous two non-redundant : 12
% 0.07/0.35 % ...aggressively subsumed : 0
% 0.07/0.35 % Contextual simplify-reflections : 1
% 0.07/0.35 % Paramodulations : 24
% 0.07/0.35 % Factorizations : 0
% 0.07/0.35 % NegExts : 0
% 0.07/0.35 % Equation resolutions : 0
% 0.07/0.35 % Disequality decompositions : 0
% 0.07/0.35 % Total rewrite steps : 8
% 0.07/0.35 % ...of those cached : 3
% 0.07/0.35 % Propositional unsat checks : 0
% 0.07/0.35 % Propositional check models : 0
% 0.07/0.35 % Propositional check unsatisfiable : 0
% 0.07/0.35 % Propositional clauses : 0
% 0.07/0.35 % Propositional clauses after purity: 0
% 0.07/0.35 % Propositional unsat core size : 0
% 0.07/0.35 % Propositional preprocessing time : 0.000
% 0.07/0.35 % Propositional encoding time : 0.000
% 0.07/0.35 % Propositional solver time : 0.000
% 0.07/0.35 % Success case prop preproc time : 0.000
% 0.07/0.35 % Success case prop encoding time : 0.000
% 0.07/0.35 % Success case prop solver time : 0.000
% 0.07/0.35 % Current number of processed clauses : 44
% 0.07/0.35 % Positive orientable unit clauses : 10
% 0.07/0.35 % Positive unorientable unit clauses: 0
% 0.07/0.35 % Negative unit clauses : 2
% 0.07/0.35 % Non-unit-clauses : 32
% 0.07/0.35 % Current number of unprocessed clauses: 7
% 0.07/0.35 % ...number of literals in the above : 16
% 0.07/0.35 % Current number of archived formulas : 0
% 0.07/0.35 % Current number of archived clauses : 1
% 0.07/0.35 % Clause-clause subsumption calls (NU) : 272
% 0.07/0.35 % Rec. Clause-clause subsumption calls : 219
% 0.07/0.35 % Non-unit clause-clause subsumptions : 1
% 0.07/0.35 % Unit Clause-clause subsumption calls : 3
% 0.07/0.35 % Rewrite failures with RHS unbound : 0
% 0.07/0.35 % BW rewrite match attempts : 0
% 0.07/0.35 % BW rewrite match successes : 0
% 0.07/0.35 % Condensation attempts : 0
% 0.07/0.35 % Condensation successes : 0
% 0.07/0.35 % Termbank termtop insertions : 2413
% 0.07/0.35 % Search garbage collected termcells : 560
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.003 s
% 0.07/0.35 % System time : 0.003 s
% 0.07/0.35 % Total time : 0.006 s
% 0.07/0.35 % Maximum resident set size: 3648 pages
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.009 s
% 0.07/0.35 % System time : 0.011 s
% 0.07/0.35 % Total time : 0.020 s
% 0.07/0.35 % Maximum resident set size: 4864 pages
% 0.07/0.35 % E exiting
%------------------------------------------------------------------------------