%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR026+1 : 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 : n006.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 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 16 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 14 ~; 11 |; 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 : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query26,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query26) ).
fof(just48,axiom,
! [X16,X17] :
( ( genlmt(X16,X17)
& mtvisible(X16) )
=> mtvisible(X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just48) ).
fof(just8,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just8) ).
fof(just7,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just7) ).
fof(just9,axiom,
! [X1] :
( ( runningshorts(X1)
& mtvisible(c_tptp_member2701_mt) )
=> tptpofobject(X1,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just9) ).
fof(just6,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just6) ).
fof(just11,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just11) ).
fof(just5,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just5) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query26]) ).
fof(c_0_9,plain,
! [X19,X20] :
( mtvisible(X20)
| ~ genlmt(X19,X20)
| ~ mtvisible(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just48])])]) ).
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_spindlecollectormt,c_tptp_member3993_mt),
inference(split_conjunct,[status(thm)],[just8]) ).
cnf(c_0_13,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[just7]) ).
cnf(c_0_15,plain,
mtvisible(c_tptp_member3993_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_16,plain,
! [X18] :
( tptpofobject(X18,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X18)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])])]) ).
cnf(c_0_17,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[just6]) ).
fof(c_0_18,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])]) ).
cnf(c_0_19,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[just5]) ).
cnf(c_0_20,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_15])]) ).
cnf(c_0_21,plain,
( ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(X1,f_tptpquantityfn_2(n_756)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_13])]) ).
cnf(c_0_23,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_20])]) ).
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,
( ~ runningshorts(X1)
| tptpofobject(X1,f_tptpquantityfn_2(n_756)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_27,plain,
runningshorts(c_tptprunningshorts),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR026+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 14:24:27 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % new_bool_3 with pid 3071533 completed with status 0
% 0.11/0.43 % Result found by new_bool_3
% 0.11/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FHUNF-FFSM11-SFFFFFNN
% 0.11/0.43 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 3071536 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FHUNF-FFSM11-SFFFFFNN
% 0.11/0.43 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 57
% 0.11/0.43 % Removed by relevancy pruning/SinE : 44
% 0.11/0.43 % Initial clauses : 14
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 14
% 0.11/0.43 % Processed clauses : 20
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 20
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 0
% 0.11/0.43 % Backward-rewritten : 1
% 0.11/0.43 % Generated clauses : 8
% 0.11/0.43 % ...of the previous two non-redundant : 7
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 8
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 9
% 0.11/0.43 % ...of those cached : 2
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 19
% 0.11/0.43 % Positive orientable unit clauses : 14
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 1
% 0.11/0.43 % Non-unit-clauses : 4
% 0.11/0.43 % Current number of unprocessed clauses: 1
% 0.11/0.43 % ...number of literals in the above : 3
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 1
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 4
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 4
% 0.11/0.43 % Non-unit clause-clause subsumptions : 0
% 0.11/0.43 % Unit Clause-clause subsumption calls : 1
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 1
% 0.11/0.43 % BW rewrite match successes : 1
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 987
% 0.11/0.43 % Search garbage collected termcells : 317
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.001 s
% 0.11/0.43 % System time : 0.005 s
% 0.11/0.43 % Total time : 0.006 s
% 0.11/0.43 % Maximum resident set size: 3688 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.002 s
% 0.11/0.43 % System time : 0.008 s
% 0.11/0.43 % Total time : 0.010 s
% 0.11/0.43 % Maximum resident set size: 4608 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------