%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR080+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 12:16:36 PM UTC 2026
% Result : Theorem 155.72s 28.29s
% Output : CNFRefutation 155.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 24 unt; 0 def)
% Number of atoms : 145 ( 28 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 160 ( 62 ~; 62 |; 27 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 64 ( 21 sgn 27 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_49882,axiom,
! [X2266] :
( s__instance(X2266,s__Train)
=> ? [X1,X15] :
( X1 != X15
& s__instance(X15,s__RollingStock)
& s__instance(X1,s__RollingStock) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_49882) ).
fof(prove_from_ALL,conjecture,
s__part(s__Object6_1,s__Object6_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X137,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X136,s__SetOrClass) )
=> ( ( s__instance(X1139,X12)
& s__instance(X34,X137)
& s__instance(X1138,X136) )
=> ( ( s__instance(X1139,X137)
| s__instance(X1139,X136) )
& s__instance(X34,X12)
& s__instance(X1138,X12) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_26742,axiom,
! [X548,X550] :
( ( s__instance(X548,s__Substance)
& s__instance(X550,s__Substance) )
=> ( s__piece(X548,X550)
=> s__part(X548,X550) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26742) ).
fof(local_5,axiom,
s__piece(s__Object6_2,s__Object6_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_5) ).
fof(local_2,axiom,
s__instance(s__Object6_2,s__Substance),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_3,axiom,
s__instance(s__Object6_3,s__Substance),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(kb_SUMO_49908,axiom,
! [X2266] :
( s__instance(X2266,s__Train)
=> ~ ? [X1,X15] :
( X1 != X15
& s__instance(X15,s__RollingStock)
& s__instance(X1,s__RollingStock) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_49908) ).
fof(local_4,axiom,
s__piece(s__Object6_1,s__Object6_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_4) ).
fof(local_1,axiom,
s__instance(s__Object6_1,s__Substance),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(c_0_10,plain,
! [X2266] :
( s__instance(X2266,s__Train)
=> ? [X1,X15] :
( X1 != X15
& s__instance(X15,s__RollingStock)
& s__instance(X1,s__RollingStock) ) ),
inference(fof_simplification,[status(thm)],[kb_SUMO_49882]) ).
fof(c_0_11,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_12,plain,
! [X4908] :
( ( ~ s__instance(X4908,s__Train)
| esk449_0 != esk450_0 )
& ( ~ s__instance(X4908,s__Train)
| s__instance(esk450_0,s__RollingStock) )
& ( ~ s__instance(X4908,s__Train)
| s__instance(esk449_0,s__RollingStock) ) ),
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)],[c_0_10])])])])])])]) ).
fof(c_0_13,plain,
! [X2461,X2462,X2463,X2464,X2465,X2466,X2467,X2468,X2469] :
( ( X2468 = s__UnionFn(X2469,X2467)
| ~ s__instance(esk14_3(X2467,X2468,X2469),X2468)
| ~ s__instance(esk13_3(X2467,X2468,X2469),X2468)
| ~ s__instance(esk15_3(X2467,X2468,X2469),X2467) )
& ( X2468 = s__UnionFn(X2469,X2467)
| ~ s__instance(esk14_3(X2467,X2468,X2469),X2468)
| ~ s__instance(esk13_3(X2467,X2468,X2469),X2468)
| ~ s__instance(esk15_3(X2467,X2468,X2469),X2469) )
& ( X2468 = s__UnionFn(X2469,X2467)
| s__instance(esk15_3(X2467,X2468,X2469),X2468) )
& ( X2468 = s__UnionFn(X2469,X2467)
| s__instance(esk14_3(X2467,X2468,X2469),X2467) )
& ( X2468 = s__UnionFn(X2469,X2467)
| s__instance(esk13_3(X2467,X2468,X2469),X2469) )
& ( X2468 = s__UnionFn(X2469,X2467)
| s__instance(X2467,s__SetOrClass) )
& ( X2468 = s__UnionFn(X2469,X2467)
| s__instance(X2468,s__SetOrClass) )
& ( X2468 = s__UnionFn(X2469,X2467)
| s__instance(X2469,s__SetOrClass) )
& ( X2462 != s__UnionFn(X2463,X2461)
| ~ s__instance(X2461,s__SetOrClass)
| ~ s__instance(X2462,s__SetOrClass)
| ~ s__instance(X2463,s__SetOrClass)
| ~ s__instance(X2466,X2462)
| ~ s__instance(X2465,X2461)
| ~ s__instance(X2464,X2463)
| s__instance(X2466,X2461)
| s__instance(X2466,X2463) )
& ( X2462 != s__UnionFn(X2463,X2461)
| ~ s__instance(X2461,s__SetOrClass)
| ~ s__instance(X2462,s__SetOrClass)
| ~ s__instance(X2463,s__SetOrClass)
| ~ s__instance(X2466,X2462)
| ~ s__instance(X2465,X2461)
| ~ s__instance(X2464,X2463)
| s__instance(X2465,X2462) )
& ( X2462 != s__UnionFn(X2463,X2461)
| ~ s__instance(X2461,s__SetOrClass)
| ~ s__instance(X2462,s__SetOrClass)
| ~ s__instance(X2463,s__SetOrClass)
| ~ s__instance(X2466,X2462)
| ~ s__instance(X2465,X2461)
| ~ s__instance(X2464,X2463)
| s__instance(X2464,X2462) ) ),
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)],[kb_SUMO_32603])])])])])])]) ).
fof(c_0_14,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ s__instance(X1,s__Train)
| s__instance(esk449_0,s__RollingStock) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(esk13_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( s__instance(esk449_0,s__RollingStock)
| X1 = s__UnionFn(s__Train,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X2545,X2546] :
( s__part(X2545,X2546)
| ~ s__piece(X2545,X2546)
| ~ s__instance(X2545,s__Substance)
| ~ s__instance(X2546,s__Substance) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26742])])]) ).
cnf(c_0_20,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( s__instance(esk449_0,s__RollingStock)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_22,plain,
( ~ s__piece(X2,X1)
| ~ s__instance(X2,s__Substance)
| ~ s__instance(X1,s__Substance)
| s__part(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
s__piece(s__Object6_2,s__Object6_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_24,plain,
s__instance(s__Object6_2,s__Substance),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_25,plain,
s__instance(s__Object6_3,s__Substance),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_26,plain,
( ~ s__instance(X1,s__Train)
| s__instance(esk450_0,s__RollingStock) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X2266] :
( s__instance(X2266,s__Train)
=> ~ ? [X1,X15] :
( X1 != X15
& s__instance(X15,s__RollingStock)
& s__instance(X1,s__RollingStock) ) ),
inference(fof_simplification,[status(thm)],[kb_SUMO_49908]) ).
cnf(c_0_28,negated_conjecture,
( ~ s__part(X1,s__Object6_3)
| s__instance(esk449_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
s__part(s__Object6_2,s__Object6_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( s__instance(esk450_0,s__RollingStock)
| X1 = s__UnionFn(s__Train,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
fof(c_0_31,plain,
! [X4911,X4912,X4913] :
( X4912 = X4913
| ~ s__instance(X4913,s__RollingStock)
| ~ s__instance(X4912,s__RollingStock)
| ~ s__instance(X4911,s__Train) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
cnf(c_0_32,negated_conjecture,
s__instance(esk449_0,s__RollingStock),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( s__instance(esk450_0,s__RollingStock)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_30,c_0_30]) ).
cnf(c_0_34,plain,
( ~ s__instance(X3,s__RollingStock)
| ~ s__instance(X2,s__RollingStock)
| ~ s__instance(X1,s__Train)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( s__instance(X1,s__RollingStock)
| s__instance(esk450_0,s__RollingStock) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( ~ s__instance(X2,s__Train)
| ~ s__instance(X1,s__RollingStock)
| X1 = esk449_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
s__instance(esk450_0,s__RollingStock),
inference(ef,[status(thm)],[c_0_35]) ).
cnf(c_0_38,plain,
( ~ s__instance(X1,s__Train)
| esk449_0 != esk450_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
~ s__instance(X1,s__Train),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
X1 = s__UnionFn(s__Train,X2),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_41,plain,
s__piece(s__Object6_1,s__Object6_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_42,plain,
s__instance(s__Object6_1,s__Substance),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_43,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_40,c_0_40]) ).
cnf(c_0_44,plain,
s__part(s__Object6_1,s__Object6_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_41]),c_0_42]),c_0_24])]) ).
cnf(c_0_45,negated_conjecture,
~ s__part(s__Object6_1,X1),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_46,plain,
$false,
inference(sr,[status(thm)],[c_0_44,c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR080+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.55 % Computer : n017.cluster.edu
% 0.11/0.55 % Model : x86_64 x86_64
% 0.11/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55 % Memory : 8046.5625MB
% 0.11/0.55 % OS : Linux 6.8.0-71-generic
% 0.11/0.55 % CPULimit : 300
% 0.11/0.55 % WCLimit : 300
% 0.11/0.55 % DateTime : Mon Sep 21 14:45:14 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.59 Running first-order theorem proving
% 0.14/0.59 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
% 155.72/28.29 % Version: 3.5.1
% 155.72/28.29 % Preprocessing class: FLLLSMSLSSSNFFN.
% 155.72/28.29 % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 155.72/28.29 % Starting G-E--_300_C01_S5PRR_S00 with 1475s (5) cores
% 155.72/28.29 % Starting new_bool_3 with 295s (1) cores
% 155.72/28.29 % Starting new_bool_1 with 295s (1) cores
% 155.72/28.29 % Starting sh5l with 295s (1) cores
% 155.72/28.29 % sh5l with pid 2573530 completed with status 0
% 155.72/28.29 % Result found by sh5l
% 155.72/28.29 % Preprocessing class: FLLLSMSLSSSNFFN.
% 155.72/28.29 % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 155.72/28.29 % Starting G-E--_300_C01_S5PRR_S00 with 1475s (5) cores
% 155.72/28.29 % Starting new_bool_3 with 295s (1) cores
% 155.72/28.29 % Starting new_bool_1 with 295s (1) cores
% 155.72/28.29 % Starting sh5l with 295s (1) cores
% 155.72/28.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 155.72/28.29 % SinE strategy is gf500_gu_R04_F100_L20000
% 155.72/28.29 % Search class: FGHSM-SMLM32-MFFFFFNN
% 155.72/28.29 % Scheduled 13 strats onto 1 cores with 293 seconds (293 total)
% 155.72/28.29 % Starting SubtermCWHack with 27s (1) cores
% 155.72/28.29 % SubtermCWHack with pid 2573549 completed with status 0
% 155.72/28.29 % Result found by SubtermCWHack
% 155.72/28.29 % Preprocessing class: FLLLSMSLSSSNFFN.
% 155.72/28.29 % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 155.72/28.29 % Starting G-E--_300_C01_S5PRR_S00 with 1475s (5) cores
% 155.72/28.29 % Starting new_bool_3 with 295s (1) cores
% 155.72/28.29 % Starting new_bool_1 with 295s (1) cores
% 155.72/28.29 % Starting sh5l with 295s (1) cores
% 155.72/28.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 155.72/28.29 % SinE strategy is gf500_gu_R04_F100_L20000
% 155.72/28.29 % Search class: FGHSM-SMLM32-MFFFFFNN
% 155.72/28.29 % Scheduled 13 strats onto 1 cores with 293 seconds (293 total)
% 155.72/28.29 % Starting SubtermCWHack with 27s (1) cores
% 155.72/28.29 % Preprocessing time : 0.400 s
% 155.72/28.29
% 155.72/28.29 % Proof found!
% 155.72/28.29 % SZS status Theorem
% 155.72/28.29 % SZS output start CNFRefutation
% See solution above
% 155.72/28.29 % Parsed axioms : 145107
% 155.72/28.29 % Removed by relevancy pruning/SinE : 132572
% 155.72/28.29 % Initial clauses : 14916
% 155.72/28.29 % Removed in clause preprocessing : 156
% 155.72/28.29 % Initial clauses in saturation : 14760
% 155.72/28.29 % Processed clauses : 21451
% 155.72/28.29 % ...of these trivial : 5313
% 155.72/28.29 % ...subsumed : 1305
% 155.72/28.29 % ...remaining for further processing : 14833
% 155.72/28.29 % Other redundant clauses eliminated : 868
% 155.72/28.29 % Clauses deleted for lack of memory : 0
% 155.72/28.29 % Backward-subsumed : 728
% 155.72/28.29 % Backward-rewritten : 2023
% 155.72/28.29 % Generated clauses : 1329821
% 155.72/28.29 % ...of the previous two non-redundant : 1325144
% 155.72/28.29 % ...aggressively subsumed : 0
% 155.72/28.29 % Contextual simplify-reflections : 5
% 155.72/28.29 % Paramodulations : 1328923
% 155.72/28.29 % Factorizations : 12
% 155.72/28.29 % NegExts : 0
% 155.72/28.29 % Equation resolutions : 868
% 155.72/28.29 % Disequality decompositions : 0
% 155.72/28.29 % Total rewrite steps : 16508
% 155.72/28.29 % ...of those cached : 11319
% 155.72/28.29 % Propositional unsat checks : 0
% 155.72/28.29 % Propositional check models : 0
% 155.72/28.29 % Propositional check unsatisfiable : 0
% 155.72/28.29 % Propositional clauses : 0
% 155.72/28.29 % Propositional clauses after purity: 0
% 155.72/28.29 % Propositional unsat core size : 0
% 155.72/28.29 % Propositional preprocessing time : 0.000
% 155.72/28.29 % Propositional encoding time : 0.000
% 155.72/28.29 % Propositional solver time : 0.000
% 155.72/28.29 % Success case prop preproc time : 0.000
% 155.72/28.29 % Success case prop encoding time : 0.000
% 155.72/28.29 % Success case prop solver time : 0.000
% 155.72/28.29 % Current number of processed clauses : 12056
% 155.72/28.29 % Positive orientable unit clauses : 10994
% 155.72/28.29 % Positive unorientable unit clauses: 1
% 155.72/28.29 % Negative unit clauses : 8
% 155.72/28.29 % Non-unit-clauses : 1053
% 155.72/28.29 % Current number of unprocessed clauses: 219675
% 155.72/28.29 % ...number of literals in the above : 637734
% 155.72/28.29 % Current number of archived formulas : 0
% 155.72/28.29 % Current number of archived clauses : 2769
% 155.72/28.29 % Clause-clause subsumption calls (NU) : 505652
% 155.72/28.29 % Rec. Clause-clause subsumption calls : 427735
% 155.72/28.29 % Non-unit clause-clause subsumptions : 1338
% 155.72/28.29 % Unit Clause-clause subsumption calls : 310491
% 155.72/28.29 % Rewrite failures with RHS unbound : 11808
% 155.72/28.29 % BW rewrite match attempts : 53752
% 155.72/28.29 % BW rewrite match successes : 11903
% 155.72/28.29 % Condensation attempts : 0
% 155.72/28.29 % Condensation successes : 0
% 155.72/28.29 % Termbank termtop insertions : 6473247
% 155.72/28.29 % Search garbage collected termcells : 492482
% 155.72/28.29
% 155.72/28.29 % -------------------------------------------------
% 155.72/28.29 % User time : 20.501 s
% 155.72/28.29 % System time : 1.006 s
% 155.72/28.29 % Total time : 21.508 s
% 155.72/28.29 % Maximum resident set size: 183392 pages
% 155.72/28.29
% 155.72/28.29 % -------------------------------------------------
% 155.72/28.29 % User time : 25.475 s
% 155.72/28.29 % System time : 1.226 s
% 155.72/28.29 % Total time : 26.701 s
% 155.72/28.29 % Maximum resident set size: 104704 pages
% 155.72/28.29 % E exiting
%------------------------------------------------------------------------------