%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR026+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:56 PM UTC 2026
% Result : Theorem 4.06s 1.39s
% Output : CNFRefutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 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(query126,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query126) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( genlmt(X21,X22)
& mtvisible(X21) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_142,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_142) ).
fof(ax2_1645,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_1645) ).
fof(ax2_2882,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_2882) ).
fof(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_4288) ).
fof(ax2_3822,axiom,
! [X2] :
( ( runningshorts(X2)
& mtvisible(c_tptp_member2701_mt) )
=> tptpofobject(X2,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_3822) ).
fof(ax2_1317,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_1317) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query126]) ).
fof(c_0_9,plain,
! [X5978,X5979] :
( mtvisible(X5979)
| ~ genlmt(X5978,X5979)
| ~ mtvisible(X5978) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).
fof(c_0_10,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])]) ).
cnf(c_0_11,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_142]) ).
cnf(c_0_13,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[ax2_1645]) ).
cnf(c_0_14,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[ax2_2882]) ).
cnf(c_0_16,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax2_4288]) ).
fof(c_0_17,plain,
! [X1150] :
( tptpofobject(X1150,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1150)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3822])])]) ).
fof(c_0_18,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1317])]) ).
cnf(c_0_19,plain,
( ~ mtvisible(c_tptp_member3633_mt)
| mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_14])]) ).
cnf(c_0_21,plain,
mtvisible(c_tptp_member3633_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_14])]) ).
cnf(c_0_22,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| mtvisible(c_cyclistsmt) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_23,plain,
( ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(X1,f_tptpquantityfn_2(n_756)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_19,c_0_20,c_0_21,c_0_22,c_0_23,c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR026+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n018.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.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 14:26:44 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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
% 4.06/1.39 % Version: 3.5.1
% 4.06/1.39 % Preprocessing class: FMLLMMSLSSSNFFN.
% 4.06/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.06/1.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 4.06/1.39 % Starting new_bool_3 with 300s (1) cores
% 4.06/1.39 % Starting new_bool_1 with 300s (1) cores
% 4.06/1.39 % Starting sh5l with 300s (1) cores
% 4.06/1.39 % new_bool_1 with pid 2132341 completed with status 9
% 4.06/1.39 % new_bool_3 with pid 2132340 completed with status 9
% 4.06/1.39 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 2132339 completed with status 0
% 4.06/1.39 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 4.06/1.39 % Preprocessing class: FMLLMMSLSSSNFFN.
% 4.06/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.06/1.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 4.06/1.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.06/1.39 % No SInE strategy applied
% 4.06/1.39 % Search class: FHHNM-SMLM31-MFFFFFNN
% 4.06/1.39 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 4.06/1.39 % Starting SubtermCWHack with 151s (1) cores
% 4.06/1.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 901s (1) cores
% 4.06/1.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 151s (1) cores
% 4.06/1.39 % Starting new_bool_3 with 151s (1) cores
% 4.06/1.39 % Starting new_bool_1 with 146s (1) cores
% 4.06/1.39 % G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 2132392 completed with status 0
% 4.06/1.39 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 4.06/1.39 % Preprocessing class: FMLLMMSLSSSNFFN.
% 4.06/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.06/1.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 4.06/1.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.06/1.39 % No SInE strategy applied
% 4.06/1.39 % Search class: FHHNM-SMLM31-MFFFFFNN
% 4.06/1.39 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 4.06/1.39 % Starting SubtermCWHack with 151s (1) cores
% 4.06/1.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 901s (1) cores
% 4.06/1.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 151s (1) cores
% 4.06/1.39 % Preprocessing time : 0.073 s
% 4.06/1.39 % SatCheck found unsatisfiable ground set
% 4.06/1.39
% 4.06/1.39 % Proof found!
% 4.06/1.39 % SZS status Theorem
% 4.06/1.39 % SZS output start CNFRefutation
% See solution above
% 4.06/1.39 % Parsed axioms : 8006
% 4.06/1.39 % Removed by relevancy pruning/SinE : 0
% 4.06/1.39 % Initial clauses : 8007
% 4.06/1.39 % Removed in clause preprocessing : 0
% 4.06/1.39 % Initial clauses in saturation : 8007
% 4.06/1.39 % Processed clauses : 5621
% 4.06/1.39 % ...of these trivial : 318
% 4.06/1.39 % ...subsumed : 303
% 4.06/1.39 % ...remaining for further processing : 5000
% 4.06/1.39 % Other redundant clauses eliminated : 0
% 4.06/1.39 % Clauses deleted for lack of memory : 0
% 4.06/1.39 % Backward-subsumed : 0
% 4.06/1.39 % Backward-rewritten : 23
% 4.06/1.39 % Generated clauses : 14042
% 4.06/1.39 % ...of the previous two non-redundant : 13491
% 4.06/1.39 % ...aggressively subsumed : 0
% 4.06/1.39 % Contextual simplify-reflections : 0
% 4.06/1.39 % Paramodulations : 14042
% 4.06/1.39 % Factorizations : 0
% 4.06/1.39 % NegExts : 0
% 4.06/1.39 % Equation resolutions : 0
% 4.06/1.39 % Disequality decompositions : 0
% 4.06/1.39 % Total rewrite steps : 749
% 4.06/1.39 % ...of those cached : 317
% 4.06/1.39 % Propositional unsat checks : 1
% 4.06/1.39 % Propositional check models : 0
% 4.06/1.39 % Propositional check unsatisfiable : 1
% 4.06/1.39 % Propositional clauses : 20854
% 4.06/1.39 % Propositional clauses after purity: 6023
% 4.06/1.39 % Propositional unsat core size : 7
% 4.06/1.39 % Propositional preprocessing time : 0.000
% 4.06/1.39 % Propositional encoding time : 0.015
% 4.06/1.39 % Propositional solver time : 0.004
% 4.06/1.39 % Success case prop preproc time : 0.000
% 4.06/1.39 % Success case prop encoding time : 0.015
% 4.06/1.39 % Success case prop solver time : 0.004
% 4.06/1.39 % Current number of processed clauses : 4977
% 4.06/1.39 % Positive orientable unit clauses : 2368
% 4.06/1.39 % Positive unorientable unit clauses: 0
% 4.06/1.39 % Negative unit clauses : 33
% 4.06/1.39 % Non-unit-clauses : 2576
% 4.06/1.39 % Current number of unprocessed clauses: 15877
% 4.06/1.39 % ...number of literals in the above : 27614
% 4.06/1.39 % Current number of archived formulas : 0
% 4.06/1.39 % Current number of archived clauses : 23
% 4.06/1.39 % Clause-clause subsumption calls (NU) : 1155256
% 4.06/1.39 % Rec. Clause-clause subsumption calls : 1032387
% 4.06/1.39 % Non-unit clause-clause subsumptions : 303
% 4.06/1.39 % Unit Clause-clause subsumption calls : 14445
% 4.06/1.39 % Rewrite failures with RHS unbound : 0
% 4.06/1.39 % BW rewrite match attempts : 138
% 4.06/1.39 % BW rewrite match successes : 23
% 4.06/1.39 % Condensation attempts : 0
% 4.06/1.39 % Condensation successes : 0
% 4.06/1.39 % Termbank termtop insertions : 475099
% 4.06/1.39 % Search garbage collected termcells : 41047
% 4.06/1.39
% 4.06/1.39 % -------------------------------------------------
% 4.06/1.39 % User time : 0.727 s
% 4.06/1.39 % System time : 0.083 s
% 4.06/1.39 % Total time : 0.810 s
% 4.06/1.39 % Maximum resident set size: 24180 pages
% 4.06/1.39
% 4.06/1.39 % -------------------------------------------------
% 4.06/1.39 % User time : 2.952 s
% 4.06/1.39 % System time : 0.607 s
% 4.06/1.39 % Total time : 3.559 s
% 4.06/1.39 % Maximum resident set size: 11008 pages
% 4.06/1.39 % E exiting
%------------------------------------------------------------------------------