%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS129+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:00:49 PM UTC 2026
% Result : Theorem 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 115 ( 51 ~; 39 |; 18 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 33 ( 4 sgn 20 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( cEuroMP(iKinnock)
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_3,axiom,
! [X4] :
( cEuroMP(X4)
<=> ? [X5] :
( cowlThing(X5)
& risEuroMPFrom(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_1,axiom,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_5,axiom,
! [X4,X5] :
( risEuroMPFrom(X4,X5)
<=> rhasEuroMP(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_13,axiom,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_13) ).
fof(c_0_6,negated_conjecture,
~ ( cEuroMP(iKinnock)
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_7,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_8,negated_conjecture,
~ ( cEuroMP(iKinnock)
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X37,X39,X40] :
( ( cEuroMP(X39)
| ~ cowlThing(X40)
| ~ risEuroMPFrom(X39,X40) )
& ( ~ cEuroMP(X37)
| cowlThing(esk1_1(X37)) )
& ( ~ cEuroMP(X37)
| risEuroMPFrom(X37,esk1_1(X37)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])])])]) ).
fof(c_0_10,plain,
! [X34] :
( ~ cowlNothing(X34)
& cowlThing(X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
fof(c_0_11,negated_conjecture,
( ( ~ cEuroMP(iKinnock)
| cowlNothing(esk2_0)
| ~ cowlThing(esk2_0)
| ~ xsd_integer(esk3_0)
| xsd_string(esk3_0) )
& ( ~ cEuroMP(iKinnock)
| cowlNothing(esk2_0)
| ~ cowlThing(esk2_0)
| xsd_integer(esk3_0)
| ~ xsd_string(esk3_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_8])])])])]) ).
fof(c_0_12,plain,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_13,plain,
( ~ cowlThing(X2)
| ~ risEuroMPFrom(X1,X2)
| cEuroMP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X43,X44] :
( ( risEuroMPFrom(X43,X44)
| ~ rhasEuroMP(X44,X43) )
& ( rhasEuroMP(X44,X43)
| ~ risEuroMPFrom(X43,X44) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ cowlThing(esk2_0)
| ~ xsd_string(esk3_0)
| cowlNothing(esk2_0)
| xsd_integer(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X35] :
( ( xsd_string(X35)
| xsd_integer(X35) )
& ( ~ xsd_integer(X35)
| ~ xsd_string(X35) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_18,plain,
( ~ risEuroMPFrom(X1,X2)
| cEuroMP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,plain,
( ~ rhasEuroMP(X1,X2)
| risEuroMPFrom(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ cowlThing(esk2_0)
| ~ xsd_integer(esk3_0)
| cowlNothing(esk2_0)
| xsd_string(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( ~ xsd_string(esk3_0)
| ~ cEuroMP(iKinnock)
| xsd_integer(esk3_0)
| cowlNothing(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_14])]) ).
cnf(c_0_22,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ rhasEuroMP(X2,X1)
| cEuroMP(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
rhasEuroMP(iUK,iKinnock),
inference(split_conjunct,[status(thm)],[axiom_13]) ).
cnf(c_0_26,negated_conjecture,
( ~ xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock)
| xsd_string(esk3_0)
| cowlNothing(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_14])]) ).
cnf(c_0_27,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ xsd_string(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
cEuroMP(iKinnock),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ xsd_integer(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_26,c_0_22]),c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ xsd_string(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,negated_conjecture,
~ xsd_integer(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS129+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n009.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 22:54:27 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41 % Version: 3.5.1
% 0.13/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 % Starting sh5l with 300s (1) cores
% 0.13/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 232285 completed with status 0
% 0.13/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.41 % No SInE strategy applied
% 0.13/0.41 % Search class: FGHSF-FFSM11-SFFFFFNN
% 0.13/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.41 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 232293 completed with status 0
% 0.13/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.41 % No SInE strategy applied
% 0.13/0.41 % Search class: FGHSF-FFSM11-SFFFFFNN
% 0.13/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.41 % Preprocessing time : 0.001 s
% 0.13/0.41 % Presaturation interreduction done
% 0.13/0.41
% 0.13/0.41 % Proof found!
% 0.13/0.41 % SZS status Theorem
% 0.13/0.41 % SZS output start CNFRefutation
% See solution above
% 0.13/0.41 % Parsed axioms : 27
% 0.13/0.41 % Removed by relevancy pruning/SinE : 0
% 0.13/0.41 % Initial clauses : 39
% 0.13/0.41 % Removed in clause preprocessing : 14
% 0.13/0.41 % Initial clauses in saturation : 25
% 0.13/0.41 % Processed clauses : 60
% 0.13/0.41 % ...of these trivial : 0
% 0.13/0.41 % ...subsumed : 0
% 0.13/0.41 % ...remaining for further processing : 60
% 0.13/0.41 % Other redundant clauses eliminated : 6
% 0.13/0.41 % Clauses deleted for lack of memory : 0
% 0.13/0.41 % Backward-subsumed : 0
% 0.13/0.41 % Backward-rewritten : 2
% 0.13/0.41 % Generated clauses : 14
% 0.13/0.41 % ...of the previous two non-redundant : 11
% 0.13/0.41 % ...aggressively subsumed : 0
% 0.13/0.41 % Contextual simplify-reflections : 2
% 0.13/0.41 % Paramodulations : 8
% 0.13/0.41 % Factorizations : 0
% 0.13/0.41 % NegExts : 0
% 0.13/0.41 % Equation resolutions : 6
% 0.13/0.41 % Disequality decompositions : 0
% 0.13/0.41 % Total rewrite steps : 3
% 0.13/0.41 % ...of those cached : 1
% 0.13/0.41 % Propositional unsat checks : 0
% 0.13/0.41 % Propositional check models : 0
% 0.13/0.41 % Propositional check unsatisfiable : 0
% 0.13/0.41 % Propositional clauses : 0
% 0.13/0.41 % Propositional clauses after purity: 0
% 0.13/0.41 % Propositional unsat core size : 0
% 0.13/0.41 % Propositional preprocessing time : 0.000
% 0.13/0.41 % Propositional encoding time : 0.000
% 0.13/0.41 % Propositional solver time : 0.000
% 0.13/0.41 % Success case prop preproc time : 0.000
% 0.13/0.41 % Success case prop encoding time : 0.000
% 0.13/0.41 % Success case prop solver time : 0.000
% 0.13/0.41 % Current number of processed clauses : 27
% 0.13/0.41 % Positive orientable unit clauses : 15
% 0.13/0.41 % Positive unorientable unit clauses: 0
% 0.13/0.41 % Negative unit clauses : 3
% 0.13/0.41 % Non-unit-clauses : 9
% 0.13/0.41 % Current number of unprocessed clauses: 1
% 0.13/0.41 % ...number of literals in the above : 2
% 0.13/0.41 % Current number of archived formulas : 0
% 0.13/0.41 % Current number of archived clauses : 28
% 0.13/0.41 % Clause-clause subsumption calls (NU) : 39
% 0.13/0.41 % Rec. Clause-clause subsumption calls : 31
% 0.13/0.41 % Non-unit clause-clause subsumptions : 2
% 0.13/0.41 % Unit Clause-clause subsumption calls : 25
% 0.13/0.41 % Rewrite failures with RHS unbound : 0
% 0.13/0.41 % BW rewrite match attempts : 1
% 0.13/0.41 % BW rewrite match successes : 1
% 0.13/0.41 % Condensation attempts : 0
% 0.13/0.41 % Condensation successes : 0
% 0.13/0.41 % Termbank termtop insertions : 2209
% 0.13/0.41 % Search garbage collected termcells : 466
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.006 s
% 0.13/0.41 % System time : 0.002 s
% 0.13/0.41 % Total time : 0.008 s
% 0.13/0.41 % Maximum resident set size: 3400 pages
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.013 s
% 0.13/0.41 % System time : 0.015 s
% 0.13/0.41 % Total time : 0.027 s
% 0.13/0.41 % Maximum resident set size: 4608 pages
% 0.13/0.41 % E exiting
%------------------------------------------------------------------------------