%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR026+6 : TPTP v9.3.1. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:15:57 PM UTC 2026
% Result : Theorem 0.17s 136.03s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 12 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query276,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query276) ).
fof(ax5_298008,axiom,
! [X4] :
( ( runningshorts(X4)
& mtvisible(c_tptp_member2701_mt) )
=> tptpofobject(X4,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_298008) ).
fof(ax5_3342125,axiom,
! [X32,X33] :
( ( genlmt(X32,X33)
& mtvisible(X32) )
=> mtvisible(X33) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_3342125) ).
fof(ax5_1846024,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_1846024) ).
fof(ax5_1976386,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2972_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_1976386) ).
fof(ax5_174455,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_174455) ).
fof(ax5_2068306,axiom,
genlmt(c_tptp_member2972_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_2068306) ).
fof(ax5_2035961,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+5.ax',ax5_2035961) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query276]) ).
fof(c_0_9,negated_conjecture,
( ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756))
& mtvisible(c_tptp_spindlecollectormt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_10,plain,
! [X428] :
( tptpofobject(X428,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X428)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5_298008])])]) ).
fof(c_0_11,plain,
! [X576,X577] :
( mtvisible(X577)
| ~ genlmt(X576,X577)
| ~ mtvisible(X576) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5_3342125])])]) ).
cnf(c_0_12,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(X1,f_tptpquantityfn_2(n_756)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5_1846024])]) ).
cnf(c_0_15,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2972_mt),
inference(split_conjunct,[status(thm)],[ax5_1976386]) ).
cnf(c_0_17,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(c_tptprunningshorts) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[ax5_174455]) ).
cnf(c_0_21,plain,
genlmt(c_tptp_member2972_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax5_2068306]) ).
cnf(c_0_22,plain,
mtvisible(c_tptp_member2972_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
( ~ mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_17])]) ).
cnf(c_0_25,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax5_2035961]) ).
cnf(c_0_26,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
~ mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR026+6 : TPTP v9.3.1. Bugfixed v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n019.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 : Mon Sep 21 14:25:20 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.17/136.03 % Version: 3.5.1
% 0.17/136.03 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.17/136.03 % Scheduled 4 strats onto 8 cores with 199 seconds (1592 total)
% 0.17/136.03 % Starting new_ho_10 with 398s (2) cores
% 0.17/136.03 % Starting sh3 with 398s (2) cores
% 0.17/136.03 % Starting ho_unfolding_3 with 398s (2) cores
% 0.17/136.03 % Starting new_ho_10_cnf2 with 398s (2) cores
% 0.17/136.03 % new_ho_10_cnf2 with pid 2814508 completed with status 0
% 0.17/136.03 % Result found by new_ho_10_cnf2
% 0.17/136.03 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.17/136.03 % Scheduled 4 strats onto 8 cores with 199 seconds (1592 total)
% 0.17/136.03 % Starting new_ho_10 with 398s (2) cores
% 0.17/136.03 % Starting sh3 with 398s (2) cores
% 0.17/136.03 % Starting ho_unfolding_3 with 398s (2) cores
% 0.17/136.03 % Starting new_ho_10_cnf2 with 398s (2) cores
% 0.17/136.03 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/136.03 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.17/136.03 % Search class: FHHSM-SMLM31-MFFFFFNN
% 0.17/136.03 % Scheduled 7 strats onto 2 cores with 382 seconds (382 total)
% 0.17/136.03 % Starting SubtermCWHack with 35s (1) cores
% 0.17/136.03 % Starting new_ho_10_cnf2 with 39s (1) cores
% 0.17/136.03 % new_ho_10_cnf2 with pid 2814674 completed with status 0
% 0.17/136.03 % Result found by new_ho_10_cnf2
% 0.17/136.03 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.17/136.03 % Scheduled 4 strats onto 8 cores with 199 seconds (1592 total)
% 0.17/136.03 % Starting new_ho_10 with 398s (2) cores
% 0.17/136.03 % Starting sh3 with 398s (2) cores
% 0.17/136.03 % Starting ho_unfolding_3 with 398s (2) cores
% 0.17/136.03 % Starting new_ho_10_cnf2 with 398s (2) cores
% 0.17/136.03 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/136.03 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.17/136.03 % Search class: FHHSM-SMLM31-MFFFFFNN
% 0.17/136.03 % Scheduled 7 strats onto 2 cores with 382 seconds (382 total)
% 0.17/136.03 % Starting SubtermCWHack with 35s (1) cores
% 0.17/136.03 % Starting new_ho_10_cnf2 with 39s (1) cores
% 0.17/136.03 % Preprocessing time : 2.324 s
% 0.17/136.03 % Presaturation interreduction done
% 0.17/136.03
% 0.17/136.03 % Proof found!
% 0.17/136.03 % SZS status Theorem
% 0.17/136.03 % SZS output start CNFRefutation
% See solution above
% 0.17/136.04 % Parsed axioms : 3341978
% 0.17/136.04 % Removed by relevancy pruning/SinE : 3321977
% 0.17/136.04 % Initial clauses : 20002
% 0.17/136.04 % Removed in clause preprocessing : 2
% 0.17/136.04 % Initial clauses in saturation : 20000
% 0.17/136.04 % Processed clauses : 29914
% 0.17/136.04 % ...of these trivial : 2651
% 0.17/136.04 % ...subsumed : 260
% 0.17/136.04 % ...remaining for further processing : 27002
% 0.17/136.04 % Other redundant clauses eliminated : 1
% 0.17/136.04 % Clauses deleted for lack of memory : 0
% 0.17/136.04 % Backward-subsumed : 9
% 0.17/136.04 % Backward-rewritten : 446
% 0.17/136.04 % Generated clauses : 6550
% 0.17/136.04 % ...of the previous two non-redundant : 4865
% 0.17/136.04 % ...aggressively subsumed : 0
% 0.17/136.04 % Contextual simplify-reflections : 0
% 0.17/136.04 % Paramodulations : 6549
% 0.17/136.04 % Factorizations : 0
% 0.17/136.04 % NegExts : 0
% 0.17/136.04 % Equation resolutions : 1
% 0.17/136.04 % Disequality decompositions : 0
% 0.17/136.04 % Total rewrite steps : 4787
% 0.17/136.04 % ...of those cached : 2274
% 0.17/136.04 % Propositional unsat checks : 0
% 0.17/136.04 % Propositional check models : 0
% 0.17/136.04 % Propositional check unsatisfiable : 0
% 0.17/136.04 % Propositional clauses : 0
% 0.17/136.04 % Propositional clauses after purity: 0
% 0.17/136.04 % Propositional unsat core size : 0
% 0.17/136.04 % Propositional preprocessing time : 0.000
% 0.17/136.04 % Propositional encoding time : 0.000
% 0.17/136.04 % Propositional solver time : 0.000
% 0.17/136.04 % Success case prop preproc time : 0.000
% 0.17/136.04 % Success case prop encoding time : 0.000
% 0.17/136.04 % Success case prop solver time : 0.000
% 0.17/136.04 % Current number of processed clauses : 8871
% 0.17/136.04 % Positive orientable unit clauses : 5698
% 0.17/136.04 % Positive unorientable unit clauses: 0
% 0.17/136.04 % Negative unit clauses : 1129
% 0.17/136.04 % Non-unit-clauses : 2044
% 0.17/136.04 % Current number of unprocessed clauses: 12514
% 0.17/136.04 % ...number of literals in the above : 20167
% 0.17/136.04 % Current number of archived formulas : 0
% 0.17/136.04 % Current number of archived clauses : 18130
% 0.17/136.04 % Clause-clause subsumption calls (NU) : 2781701
% 0.17/136.04 % Rec. Clause-clause subsumption calls : 2500038
% 0.17/136.04 % Non-unit clause-clause subsumptions : 197
% 0.17/136.04 % Unit Clause-clause subsumption calls : 1683946
% 0.17/136.04 % Rewrite failures with RHS unbound : 0
% 0.17/136.04 % BW rewrite match attempts : 20037
% 0.17/136.04 % BW rewrite match successes : 433
% 0.17/136.04 % Condensation attempts : 29933
% 0.17/136.04 % Condensation successes : 0
% 0.17/136.04 % Termbank termtop insertions : 22773688
% 0.17/136.04 % Search garbage collected termcells : 10458156
% 0.17/136.04
% 0.17/136.04 % -------------------------------------------------
% 0.17/136.04 % User time : 22.633 s
% 0.17/136.04 % System time : 6.485 s
% 0.17/136.04 % Total time : 29.119 s
% 0.17/136.04 % Maximum resident set size: 5024956 pages
% 0.17/136.04
% 0.17/136.04 % -------------------------------------------------
% 0.17/136.04 % User time : 131.270 s
% 0.17/136.04 % System time : 13.533 s
% 0.17/136.04 % Total time : 144.803 s
% 0.17/136.04 % Maximum resident set size: 2273536 pages
% 0.17/136.04 % E exiting
%------------------------------------------------------------------------------