%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR056+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:19 PM UTC 2026
% Result : Theorem 0.16s 37.31s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 19 ~; 14 |; 3 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 17 ( 1 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query256,conjecture,
? [X30] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X30) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query256) ).
fof(ax4_5517,axiom,
! [X7] :
( ( supplies(X7)
& mtvisible(c_tptp_member3717_mt) )
=> tptpofobject(X7,f_tptpquantityfn_17(n_385)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_5517) ).
fof(ax4_267467,axiom,
! [X1] :
( artsupplies(X1)
=> supplies(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_267467) ).
fof(ax4_211749,axiom,
( mtvisible(c_cyclistsmt)
=> artsupplies(c_tptpartsupplies) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_211749) ).
fof(ax4_540220,axiom,
! [X28,X29] :
( ( genlmt(X28,X29)
& mtvisible(X28) )
=> mtvisible(X29) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_540220) ).
fof(ax4_103057,axiom,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_103057) ).
fof(ax4_71548,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_71548) ).
fof(c_0_7,negated_conjecture,
~ ? [X30] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X30) ),
inference(assume_negation,[status(cth)],[query256]) ).
fof(c_0_8,plain,
! [X34] :
( tptpofobject(X34,f_tptpquantityfn_17(n_385))
| ~ supplies(X34)
| ~ mtvisible(c_tptp_member3717_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_5517])])]) ).
fof(c_0_9,negated_conjecture,
! [X31] :
( ~ tptpofobject(c_tptpartsupplies,X31)
& mtvisible(c_tptp_member3717_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_10,plain,
( ~ supplies(X1)
| ~ mtvisible(c_tptp_member3717_mt)
| tptpofobject(X1,f_tptpquantityfn_17(n_385)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X43] :
( supplies(X43)
| ~ artsupplies(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_267467])])]) ).
fof(c_0_13,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_211749])]) ).
cnf(c_0_14,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ supplies(X1)
| tptpofobject(X1,f_tptpquantityfn_17(n_385)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_16,plain,
( ~ artsupplies(X1)
| supplies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X72,X73] :
( mtvisible(X73)
| ~ genlmt(X72,X73)
| ~ mtvisible(X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_540220])])]) ).
cnf(c_0_19,negated_conjecture,
~ supplies(c_tptpartsupplies),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ mtvisible(c_cyclistsmt)
| supplies(c_tptpartsupplies) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax4_103057]) ).
cnf(c_0_23,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax4_71548]) ).
cnf(c_0_24,negated_conjecture,
~ mtvisible(c_cyclistsmt),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_11])]) ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CSR056+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.04/20.45 % CPULimit : 300
% 0.04/20.45 % WCLimit : 300
% 0.04/20.45 % DateTime : Mon Sep 21 14:38:28 UTC 2026
% 0.04/20.45 % CPUTime :
% 0.04/20.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/20.47 Running first-order theorem proving
% 0.04/20.47 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
% 0.16/37.31 % Version: 3.5.1
% 0.16/37.31 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.16/37.31 % Scheduled 4 strats onto 8 cores with 289 seconds (2312 total)
% 0.16/37.31 % Starting new_ho_10 with 578s (2) cores
% 0.16/37.31 % Starting sh3 with 578s (2) cores
% 0.16/37.31 % Starting ho_unfolding_3 with 578s (2) cores
% 0.16/37.31 % Starting new_ho_10_cnf2 with 578s (2) cores
% 0.16/37.31 % new_ho_10 with pid 2579706 completed with status 0
% 0.16/37.31 % Result found by new_ho_10
% 0.16/37.31 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.16/37.31 % Scheduled 4 strats onto 8 cores with 289 seconds (2312 total)
% 0.16/37.31 % Starting new_ho_10 with 578s (2) cores
% 0.16/37.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/37.31 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.16/37.31 % Search class: FHHSM-SSLM31-MFFFFFNN
% 0.16/37.31 % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.16/37.31 % Scheduled 7 strats onto 2 cores with 575 seconds (575 total)
% 0.16/37.31 % Starting SubtermCWHack with 52s (1) cores
% 0.16/37.31 % Starting new_ho_10 with 58s (1) cores
% 0.16/37.31 % SubtermCWHack with pid 2579711 completed with status 0
% 0.16/37.31 % Result found by SubtermCWHack
% 0.16/37.31 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.16/37.31 % Scheduled 4 strats onto 8 cores with 289 seconds (2312 total)
% 0.16/37.31 % Starting new_ho_10 with 578s (2) cores
% 0.16/37.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/37.31 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.16/37.31 % Search class: FHHSM-SSLM31-MFFFFFNN
% 0.16/37.31 % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.16/37.31 % Scheduled 7 strats onto 2 cores with 575 seconds (575 total)
% 0.16/37.31 % Starting SubtermCWHack with 52s (1) cores
% 0.16/37.31 % Preprocessing time : 0.362 s
% 0.16/37.31
% 0.16/37.31 % Proof found!
% 0.16/37.31 % SZS status Theorem
% 0.16/37.31 % SZS output start CNFRefutation
% See solution above
% 0.16/37.31 % Parsed axioms : 540250
% 0.16/37.31 % Removed by relevancy pruning/SinE : 539105
% 0.16/37.31 % Initial clauses : 1146
% 0.16/37.31 % Removed in clause preprocessing : 2
% 0.16/37.31 % Initial clauses in saturation : 1144
% 0.16/37.31 % Processed clauses : 1674
% 0.16/37.31 % ...of these trivial : 167
% 0.16/37.31 % ...subsumed : 24
% 0.16/37.31 % ...remaining for further processing : 1482
% 0.16/37.31 % Other redundant clauses eliminated : 1
% 0.16/37.31 % Clauses deleted for lack of memory : 0
% 0.16/37.31 % Backward-subsumed : 6
% 0.16/37.31 % Backward-rewritten : 59
% 0.16/37.31 % Generated clauses : 1704
% 0.16/37.31 % ...of the previous two non-redundant : 1059
% 0.16/37.31 % ...aggressively subsumed : 0
% 0.16/37.31 % Contextual simplify-reflections : 0
% 0.16/37.31 % Paramodulations : 1703
% 0.16/37.31 % Factorizations : 0
% 0.16/37.31 % NegExts : 0
% 0.16/37.31 % Equation resolutions : 1
% 0.16/37.31 % Disequality decompositions : 0
% 0.16/37.31 % Total rewrite steps : 824
% 0.16/37.31 % ...of those cached : 584
% 0.16/37.31 % Propositional unsat checks : 0
% 0.16/37.31 % Propositional check models : 0
% 0.16/37.31 % Propositional check unsatisfiable : 0
% 0.16/37.31 % Propositional clauses : 0
% 0.16/37.31 % Propositional clauses after purity: 0
% 0.16/37.31 % Propositional unsat core size : 0
% 0.16/37.31 % Propositional preprocessing time : 0.000
% 0.16/37.31 % Propositional encoding time : 0.000
% 0.16/37.31 % Propositional solver time : 0.000
% 0.16/37.31 % Success case prop preproc time : 0.000
% 0.16/37.31 % Success case prop encoding time : 0.000
% 0.16/37.31 % Success case prop solver time : 0.000
% 0.16/37.31 % Current number of processed clauses : 1416
% 0.16/37.31 % Positive orientable unit clauses : 858
% 0.16/37.31 % Positive unorientable unit clauses: 0
% 0.16/37.31 % Negative unit clauses : 219
% 0.16/37.31 % Non-unit-clauses : 339
% 0.16/37.31 % Current number of unprocessed clauses: 524
% 0.16/37.31 % ...number of literals in the above : 866
% 0.16/37.31 % Current number of archived formulas : 0
% 0.16/37.31 % Current number of archived clauses : 65
% 0.16/37.31 % Clause-clause subsumption calls (NU) : 15336
% 0.16/37.31 % Rec. Clause-clause subsumption calls : 14376
% 0.16/37.31 % Non-unit clause-clause subsumptions : 21
% 0.16/37.31 % Unit Clause-clause subsumption calls : 31017
% 0.16/37.31 % Rewrite failures with RHS unbound : 0
% 0.16/37.31 % BW rewrite match attempts : 73
% 0.16/37.31 % BW rewrite match successes : 55
% 0.16/37.31 % Condensation attempts : 0
% 0.16/37.31 % Condensation successes : 0
% 0.16/37.31 % Termbank termtop insertions : 3726416
% 0.16/37.31 % Search garbage collected termcells : 2173025
% 0.16/37.31
% 0.16/37.31 % -------------------------------------------------
% 0.16/37.31 % User time : 3.223 s
% 0.16/37.31 % System time : 1.415 s
% 0.16/37.31 % Total time : 4.638 s
% 0.16/37.31 % Maximum resident set size: 1242124 pages
% 0.16/37.31
% 0.16/37.31 % -------------------------------------------------
% 0.16/37.31 % User time : 14.751 s
% 0.16/37.31 % System time : 2.353 s
% 0.16/37.31 % Total time : 17.104 s
% 0.16/37.31 % Maximum resident set size: 456704 pages
% 0.16/37.31 % E exiting
%------------------------------------------------------------------------------