%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS131+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 : n017.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.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 8 unt; 0 def)
% Number of atoms : 151 ( 0 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 178 ( 73 ~; 71 |; 21 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 52 ( 6 sgn 29 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(the_axiom,conjecture,
( ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_2,axiom,
! [X1] :
( cA(X1)
<=> ? [X2] :
( cowlThing(X2)
& rq(X1,X2) ) ),
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_5,axiom,
! [X1] :
( cnotA(X1)
<=> ! [X2] :
( rq(X1,X2)
=> cNothing(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_4,axiom,
! [X1] :
( cNothing(X1)
=> ? [X3] : rp(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X1] :
( cNothing(X1)
=> ~ ? [X2] : rp(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(c_0_7,plain,
! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_8,negated_conjecture,
~ ( ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_9,plain,
! [X7,X9,X10] :
( ( cA(X9)
| ~ cowlThing(X10)
| ~ rq(X9,X10) )
& ( ~ cA(X7)
| cowlThing(esk4_1(X7)) )
& ( ~ cA(X7)
| rq(X7,esk4_1(X7)) ) ),
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_2])])])])])])]) ).
fof(c_0_10,plain,
! [X16] :
( ~ cowlNothing(X16)
& cowlThing(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
fof(c_0_11,negated_conjecture,
~ ( ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_13,plain,
( ~ cowlThing(X2)
| ~ rq(X1,X2)
| cA(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,
! [X11,X12,X13] :
( ( cnotA(X13)
| ~ cNothing(esk5_1(X13)) )
& ( cnotA(X13)
| rq(X13,esk5_1(X13)) )
& ( cNothing(X12)
| ~ rq(X11,X12)
| ~ cnotA(X11) ) ),
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_5])])])])])])]) ).
fof(c_0_16,plain,
! [X19] :
( rp(X19,esk6_1(X19))
| ~ cNothing(X19) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])]) ).
fof(c_0_17,plain,
! [X17,X18] :
( ~ rp(X17,X18)
| ~ cNothing(X17) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
fof(c_0_18,negated_conjecture,
( ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| ~ cA(esk3_0)
| cnotA(esk3_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| cA(esk3_0)
| ~ cnotA(esk3_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cA(esk3_0)
| cnotA(esk3_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| cA(esk3_0)
| ~ cnotA(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_11])])])])]) ).
fof(c_0_19,plain,
! [X15] :
( ( xsd_string(X15)
| xsd_integer(X15) )
& ( ~ xsd_integer(X15)
| ~ xsd_string(X15) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_20,plain,
( ~ rq(X1,X2)
| cA(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_21,plain,
( cnotA(X1)
| rq(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ cNothing(X1)
| rp(X1,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ rp(X1,X2)
| ~ cNothing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cnotA(esk3_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cA(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( cA(X1)
| cnotA(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ rq(X1,X2)
| ~ cnotA(X1)
| cNothing(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,plain,
~ cNothing(X1),
inference(csr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,negated_conjecture,
( xsd_integer(esk2_0)
| cA(esk3_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_14])]),c_0_25]),c_0_26]),c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cnotA(esk3_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cA(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,plain,
( ~ rq(X1,X2)
| ~ cnotA(X1) ),
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( ~ cA(X1)
| rq(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( ~ xsd_string(esk2_0)
| cA(esk3_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( ~ cnotA(esk3_0)
| xsd_string(esk2_0)
| cA(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_14])]),c_0_25]),c_0_26]) ).
cnf(c_0_37,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA(esk3_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cnotA(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_38,plain,
( ~ cA(X1)
| ~ cnotA(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
cA(esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( xsd_string(esk2_0)
| cnotA(esk3_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_14])]),c_0_25]),c_0_26]),c_0_27]) ).
cnf(c_0_41,negated_conjecture,
~ cnotA(esk3_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA(esk3_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cnotA(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,negated_conjecture,
xsd_string(esk2_0),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
xsd_integer(esk2_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_14]),c_0_43]),c_0_39])]),c_0_25]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_44]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS131+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.09/0.37 % Computer : n017.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 22:49:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % new_bool_1 with pid 808803 completed with status 0
% 0.09/0.43 % Result found by new_bool_1
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 808805 completed with status 0
% 0.09/0.43 % Result found by SubtermCWHack
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % Preprocessing time : 0.001 s
% 0.09/0.43
% 0.09/0.43 % Proof found!
% 0.09/0.43 % SZS status Theorem
% 0.09/0.43 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 7
% 0.09/0.43 % Removed by relevancy pruning/SinE : 0
% 0.09/0.43 % Initial clauses : 16
% 0.09/0.43 % Removed in clause preprocessing : 0
% 0.09/0.43 % Initial clauses in saturation : 16
% 0.09/0.43 % Processed clauses : 22
% 0.09/0.43 % ...of these trivial : 1
% 0.09/0.43 % ...subsumed : 0
% 0.09/0.43 % ...remaining for further processing : 21
% 0.09/0.43 % Other redundant clauses eliminated : 0
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 2
% 0.09/0.43 % Backward-rewritten : 3
% 0.09/0.43 % Generated clauses : 12
% 0.09/0.43 % ...of the previous two non-redundant : 7
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 7
% 0.09/0.43 % Paramodulations : 11
% 0.09/0.43 % Factorizations : 0
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 0
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 12
% 0.09/0.43 % ...of those cached : 7
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 15
% 0.09/0.43 % Positive orientable unit clauses : 4
% 0.09/0.43 % Positive unorientable unit clauses: 0
% 0.09/0.43 % Negative unit clauses : 3
% 0.09/0.43 % Non-unit-clauses : 8
% 0.09/0.43 % Current number of unprocessed clauses: 1
% 0.09/0.43 % ...number of literals in the above : 2
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 6
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 45
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 33
% 0.09/0.43 % Non-unit clause-clause subsumptions : 7
% 0.09/0.43 % Unit Clause-clause subsumption calls : 5
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 1
% 0.09/0.43 % BW rewrite match successes : 1
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 1159
% 0.09/0.43 % Search garbage collected termcells : 280
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.006 s
% 0.09/0.43 % System time : 0.000 s
% 0.09/0.43 % Total time : 0.006 s
% 0.09/0.43 % Maximum resident set size: 3632 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.009 s
% 0.09/0.43 % System time : 0.002 s
% 0.09/0.43 % Total time : 0.011 s
% 0.09/0.43 % Maximum resident set size: 4864 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------