%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR056+2 : TPTP v9.3.1. Released v3.4.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:19 PM UTC 2026
% Result : Theorem 0.20s 5.68s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 45 ( 21 ~; 15 |; 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 : 16 ( 1 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query106,conjecture,
? [X22] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query106) ).
fof(ax1_202,axiom,
! [X10] :
( ( supplies(X10)
& mtvisible(c_tptp_spindleheadmt) )
=> tptpofobject(X10,f_tptpquantityfn_14(n_232)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_202) ).
fof(ax1_238,axiom,
! [X1] :
( artsupplies(X1)
=> supplies(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_238) ).
fof(ax1_40,axiom,
( mtvisible(c_cyclistsmt)
=> artsupplies(c_tptpartsupplies) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_40) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( genlmt(X20,X21)
& mtvisible(X20) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).
fof(ax1_279,axiom,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_279) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_254) ).
fof(c_0_7,negated_conjecture,
~ ? [X22] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X22) ),
inference(assume_negation,[status(cth)],[query106]) ).
fof(c_0_8,negated_conjecture,
! [X23] :
( ~ tptpofobject(c_tptpartsupplies,X23)
& mtvisible(c_tptp_member3717_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X26] :
( tptpofobject(X26,f_tptpquantityfn_14(n_232))
| ~ supplies(X26)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_202])])]) ).
fof(c_0_10,plain,
! [X48] :
( supplies(X48)
| ~ artsupplies(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_238])])]) ).
fof(c_0_11,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_40])]) ).
cnf(c_0_12,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ supplies(X1)
| ~ mtvisible(c_tptp_spindleheadmt)
| tptpofobject(X1,f_tptpquantityfn_14(n_232)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ artsupplies(X1)
| supplies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X33,X34] :
( mtvisible(X34)
| ~ genlmt(X33,X34)
| ~ mtvisible(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).
cnf(c_0_17,negated_conjecture,
( ~ mtvisible(c_tptp_spindleheadmt)
| ~ supplies(c_tptpartsupplies) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ mtvisible(c_cyclistsmt)
| supplies(c_tptpartsupplies) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_279]) ).
cnf(c_0_21,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
( ~ mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax1_254]) ).
cnf(c_0_25,negated_conjecture,
~ mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_23])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR056+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.41 % Computer : n017.cluster.edu
% 0.15/5.41 % Model : x86_64 x86_64
% 0.15/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.41 % Memory : 8046.5625MB
% 0.15/5.41 % OS : Linux 6.8.0-71-generic
% 0.15/5.41 % CPULimit : 300
% 0.15/5.41 % WCLimit : 300
% 0.15/5.41 % DateTime : Mon Sep 21 14:33:34 UTC 2026
% 0.15/5.42 % CPUTime :
% 0.15/5.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.49 Running first-order theorem proving
% 0.15/5.49 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.20/5.68 % Version: 3.5.1
% 0.20/5.68 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.68 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/5.68 % Starting new_bool_3 with 600s (2) cores
% 0.20/5.68 % Starting new_bool_1 with 600s (2) cores
% 0.20/5.68 % Starting sh5l with 300s (1) cores
% 0.20/5.68 % sh5l with pid 2559257 completed with status 0
% 0.20/5.68 % Result found by sh5l
% 0.20/5.68 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.68 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/5.68 % Starting new_bool_3 with 600s (2) cores
% 0.20/5.68 % Starting new_bool_1 with 600s (2) cores
% 0.20/5.68 % Starting sh5l with 300s (1) cores
% 0.20/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/5.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/5.68 % Search class: FHHNM-FSLM31-SFFFFFNN
% 0.20/5.68 % partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.20/5.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/5.68 % Starting SubtermCWHack with 31s (1) cores
% 0.20/5.68 % SubtermCWHack with pid 2559264 completed with status 0
% 0.20/5.68 % Result found by SubtermCWHack
% 0.20/5.68 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.68 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/5.68 % Starting new_bool_3 with 600s (2) cores
% 0.20/5.68 % Starting new_bool_1 with 600s (2) cores
% 0.20/5.68 % Starting sh5l with 300s (1) cores
% 0.20/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/5.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/5.68 % Search class: FHHNM-FSLM31-SFFFFFNN
% 0.20/5.68 % partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.20/5.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/5.68 % Starting SubtermCWHack with 31s (1) cores
% 0.20/5.68 % Preprocessing time : 0.007 s
% 0.20/5.68
% 0.20/5.68 % Proof found!
% 0.20/5.68 % SZS status Theorem
% 0.20/5.68 % SZS output start CNFRefutation
% See solution above
% 0.20/5.68 % Parsed axioms : 1132
% 0.20/5.68 % Removed by relevancy pruning/SinE : 845
% 0.20/5.68 % Initial clauses : 288
% 0.20/5.68 % Removed in clause preprocessing : 0
% 0.20/5.68 % Initial clauses in saturation : 288
% 0.20/5.68 % Processed clauses : 423
% 0.20/5.68 % ...of these trivial : 12
% 0.20/5.68 % ...subsumed : 14
% 0.20/5.68 % ...remaining for further processing : 396
% 0.20/5.68 % Other redundant clauses eliminated : 0
% 0.20/5.68 % Clauses deleted for lack of memory : 0
% 0.20/5.68 % Backward-subsumed : 12
% 0.20/5.68 % Backward-rewritten : 11
% 0.20/5.68 % Generated clauses : 434
% 0.20/5.68 % ...of the previous two non-redundant : 274
% 0.20/5.68 % ...aggressively subsumed : 0
% 0.20/5.68 % Contextual simplify-reflections : 0
% 0.20/5.68 % Paramodulations : 434
% 0.20/5.68 % Factorizations : 0
% 0.20/5.68 % NegExts : 0
% 0.20/5.68 % Equation resolutions : 0
% 0.20/5.68 % Disequality decompositions : 0
% 0.20/5.68 % Total rewrite steps : 162
% 0.20/5.68 % ...of those cached : 100
% 0.20/5.68 % Propositional unsat checks : 0
% 0.20/5.68 % Propositional check models : 0
% 0.20/5.68 % Propositional check unsatisfiable : 0
% 0.20/5.68 % Propositional clauses : 0
% 0.20/5.68 % Propositional clauses after purity: 0
% 0.20/5.68 % Propositional unsat core size : 0
% 0.20/5.68 % Propositional preprocessing time : 0.000
% 0.20/5.68 % Propositional encoding time : 0.000
% 0.20/5.68 % Propositional solver time : 0.000
% 0.20/5.68 % Success case prop preproc time : 0.000
% 0.20/5.68 % Success case prop encoding time : 0.000
% 0.20/5.68 % Success case prop solver time : 0.000
% 0.20/5.68 % Current number of processed clauses : 373
% 0.20/5.68 % Positive orientable unit clauses : 202
% 0.20/5.68 % Positive unorientable unit clauses: 0
% 0.20/5.68 % Negative unit clauses : 10
% 0.20/5.68 % Non-unit-clauses : 161
% 0.20/5.68 % Current number of unprocessed clauses: 139
% 0.20/5.68 % ...number of literals in the above : 260
% 0.20/5.68 % Current number of archived formulas : 0
% 0.20/5.68 % Current number of archived clauses : 23
% 0.20/5.68 % Clause-clause subsumption calls (NU) : 6428
% 0.20/5.68 % Rec. Clause-clause subsumption calls : 6121
% 0.20/5.68 % Non-unit clause-clause subsumptions : 12
% 0.20/5.68 % Unit Clause-clause subsumption calls : 1718
% 0.20/5.68 % Rewrite failures with RHS unbound : 0
% 0.20/5.68 % BW rewrite match attempts : 1
% 0.20/5.68 % BW rewrite match successes : 1
% 0.20/5.68 % Condensation attempts : 0
% 0.20/5.68 % Condensation successes : 0
% 0.20/5.68 % Termbank termtop insertions : 22640
% 0.20/5.68 % Search garbage collected termcells : 5190
% 0.20/5.68
% 0.20/5.68 % -------------------------------------------------
% 0.20/5.68 % User time : 0.047 s
% 0.20/5.68 % System time : 0.017 s
% 0.20/5.68 % Total time : 0.065 s
% 0.20/5.68 % Maximum resident set size: 6400 pages
% 0.20/5.68
% 0.20/5.68 % -------------------------------------------------
% 0.20/5.68 % User time : 0.081 s
% 0.20/5.68 % System time : 0.023 s
% 0.20/5.68 % Total time : 0.104 s
% 0.20/5.68 % Maximum resident set size: 5888 pages
% 0.20/5.68 % E exiting
%------------------------------------------------------------------------------