%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS129+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 : 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:01:34 PM UTC 2026
% Result : Theorem 0.08s 0.42s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 97 ( 41 ~; 31 |; 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(axiom_0,axiom,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_3,axiom,
! [X4] :
( cEuroMP(X4)
<=> ? [X5] :
( cowlThing(X5)
& risEuroMPFrom(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(the_axiom,conjecture,
( cEuroMP(iKinnock)
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_5,axiom,
! [X4,X5] :
( risEuroMPFrom(X4,X5)
<=> rhasEuroMP(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_1,axiom,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_13,axiom,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(c_0_6,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_7,plain,
! [X10,X12,X13] :
( ( cEuroMP(X12)
| ~ cowlThing(X13)
| ~ risEuroMPFrom(X12,X13) )
& ( ~ cEuroMP(X10)
| cowlThing(esk3_1(X10)) )
& ( ~ cEuroMP(X10)
| risEuroMPFrom(X10,esk3_1(X10)) ) ),
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_8,plain,
! [X21] :
( ~ cowlNothing(X21)
& cowlThing(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_9,negated_conjecture,
~ ( cEuroMP(iKinnock)
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
cnf(c_0_10,plain,
( ~ cowlThing(X2)
| ~ risEuroMPFrom(X1,X2)
| cEuroMP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X30,X31] :
( ( risEuroMPFrom(X30,X31)
| ~ rhasEuroMP(X31,X30) )
& ( rhasEuroMP(X31,X30)
| ~ risEuroMPFrom(X30,X31) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
fof(c_0_13,negated_conjecture,
~ ( cEuroMP(iKinnock)
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ risEuroMPFrom(X1,X2)
| cEuroMP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_15,plain,
( ~ rhasEuroMP(X1,X2)
| risEuroMPFrom(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_17,negated_conjecture,
( ( ~ cEuroMP(iKinnock)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0) )
& ( ~ cEuroMP(iKinnock)
| 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_13])])])])]) ).
cnf(c_0_18,plain,
( ~ rhasEuroMP(X2,X1)
| cEuroMP(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
rhasEuroMP(iUK,iKinnock),
inference(split_conjunct,[status(thm)],[axiom_13]) ).
fof(c_0_20,plain,
! [X16] :
( ( xsd_string(X16)
| xsd_integer(X16) )
& ( ~ xsd_integer(X16)
| ~ xsd_string(X16) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
cEuroMP(iKinnock),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
xsd_integer(esk2_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_11])]),c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
xsd_string(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_22]),c_0_11]),c_0_26])]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS129+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.35 % Computer : n009.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 22:54:27 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.42 % Version: 3.5.1
% 0.08/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.42 % Starting sh5l with 300s (1) cores
% 0.08/0.42 % sh5l with pid 232234 completed with status 0
% 0.08/0.42 % Result found by sh5l
% 0.08/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.42 % Starting sh5l with 300s (1) cores
% 0.08/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.42 % Search class: FGHSF-FFSM11-SFFFFFNN
% 0.08/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.42 % SubtermCWHack with pid 232235 completed with status 0
% 0.08/0.42 % Result found by SubtermCWHack
% 0.08/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.42 % Starting sh5l with 300s (1) cores
% 0.08/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.42 % Search class: FGHSF-FFSM11-SFFFFFNN
% 0.08/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.42 % Preprocessing time : 0.001 s
% 0.08/0.42
% 0.08/0.42 % Proof found!
% 0.08/0.42 % SZS status Theorem
% 0.08/0.42 % SZS output start CNFRefutation
% See solution above
% 0.08/0.42 % Parsed axioms : 27
% 0.08/0.42 % Removed by relevancy pruning/SinE : 0
% 0.08/0.42 % Initial clauses : 39
% 0.08/0.42 % Removed in clause preprocessing : 12
% 0.08/0.42 % Initial clauses in saturation : 27
% 0.08/0.42 % Processed clauses : 37
% 0.08/0.42 % ...of these trivial : 1
% 0.08/0.42 % ...subsumed : 0
% 0.08/0.42 % ...remaining for further processing : 36
% 0.08/0.42 % Other redundant clauses eliminated : 6
% 0.08/0.42 % Clauses deleted for lack of memory : 0
% 0.08/0.42 % Backward-subsumed : 0
% 0.08/0.42 % Backward-rewritten : 0
% 0.08/0.42 % Generated clauses : 17
% 0.08/0.42 % ...of the previous two non-redundant : 11
% 0.08/0.42 % ...aggressively subsumed : 0
% 0.08/0.42 % Contextual simplify-reflections : 1
% 0.08/0.42 % Paramodulations : 11
% 0.08/0.42 % Factorizations : 0
% 0.08/0.42 % NegExts : 0
% 0.08/0.42 % Equation resolutions : 6
% 0.08/0.42 % Disequality decompositions : 0
% 0.08/0.42 % Total rewrite steps : 9
% 0.08/0.42 % ...of those cached : 3
% 0.08/0.42 % Propositional unsat checks : 0
% 0.08/0.42 % Propositional check models : 0
% 0.08/0.42 % Propositional check unsatisfiable : 0
% 0.08/0.42 % Propositional clauses : 0
% 0.08/0.42 % Propositional clauses after purity: 0
% 0.08/0.42 % Propositional unsat core size : 0
% 0.08/0.42 % Propositional preprocessing time : 0.000
% 0.08/0.42 % Propositional encoding time : 0.000
% 0.08/0.42 % Propositional solver time : 0.000
% 0.08/0.42 % Success case prop preproc time : 0.000
% 0.08/0.42 % Success case prop encoding time : 0.000
% 0.08/0.42 % Success case prop solver time : 0.000
% 0.08/0.42 % Current number of processed clauses : 30
% 0.08/0.42 % Positive orientable unit clauses : 18
% 0.08/0.42 % Positive unorientable unit clauses: 0
% 0.08/0.42 % Negative unit clauses : 1
% 0.08/0.42 % Non-unit-clauses : 11
% 0.08/0.42 % Current number of unprocessed clauses: 1
% 0.08/0.42 % ...number of literals in the above : 7
% 0.08/0.42 % Current number of archived formulas : 0
% 0.08/0.42 % Current number of archived clauses : 0
% 0.08/0.42 % Clause-clause subsumption calls (NU) : 58
% 0.08/0.42 % Rec. Clause-clause subsumption calls : 34
% 0.08/0.42 % Non-unit clause-clause subsumptions : 1
% 0.08/0.42 % Unit Clause-clause subsumption calls : 4
% 0.08/0.42 % Rewrite failures with RHS unbound : 0
% 0.08/0.42 % BW rewrite match attempts : 0
% 0.08/0.42 % BW rewrite match successes : 0
% 0.08/0.42 % Condensation attempts : 0
% 0.08/0.42 % Condensation successes : 0
% 0.08/0.42 % Termbank termtop insertions : 2215
% 0.08/0.42 % Search garbage collected termcells : 472
% 0.08/0.42
% 0.08/0.42 % -------------------------------------------------
% 0.08/0.42 % User time : 0.004 s
% 0.08/0.42 % System time : 0.003 s
% 0.08/0.42 % Total time : 0.007 s
% 0.08/0.42 % Maximum resident set size: 3656 pages
% 0.08/0.42
% 0.08/0.42 % -------------------------------------------------
% 0.08/0.42 % User time : 0.006 s
% 0.08/0.42 % System time : 0.007 s
% 0.08/0.42 % Total time : 0.014 s
% 0.08/0.42 % Maximum resident set size: 4608 pages
% 0.08/0.42 % E exiting
%------------------------------------------------------------------------------