%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR062+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 : n012.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:24 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 13 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 31 ( 2 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query112,conjecture,
? [X5] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X5,c_pushingwithfingers) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query112) ).
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_34,axiom,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_34) ).
fof(ax1_302,axiom,
! [X5,X6] :
( tptptypes_7_389(X5,X6)
=> tptptypes_6_388(X6,X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_302) ).
fof(ax1_61,axiom,
! [X5,X6] :
( tptptypes_8_390(X5,X6)
=> tptptypes_7_389(X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_61) ).
fof(ax1_460,axiom,
( mtvisible(c_cyclistsmt)
=> tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_460) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_254) ).
fof(ax1_99,axiom,
! [X5,X6] :
( tptptypes_6_388(X5,X6)
=> tptptypes_5_387(X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_99) ).
fof(c_0_8,negated_conjecture,
~ ? [X5] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X5,c_pushingwithfingers) ),
inference(assume_negation,[status(cth)],[query112]) ).
fof(c_0_9,plain,
! [X29,X30] :
( mtvisible(X30)
| ~ genlmt(X29,X30)
| ~ mtvisible(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).
fof(c_0_10,negated_conjecture,
! [X22] :
( ~ tptptypes_5_387(X22,c_pushingwithfingers)
& mtvisible(c_tptp_member3205_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[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_member3205_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_34]) ).
cnf(c_0_13,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X31,X32] :
( tptptypes_6_388(X32,X31)
| ~ tptptypes_7_389(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_302])])]) ).
fof(c_0_15,plain,
! [X39,X40] :
( tptptypes_7_389(X39,X40)
| ~ tptptypes_8_390(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_61])])]) ).
fof(c_0_16,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_460])]) ).
cnf(c_0_17,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax1_254]) ).
cnf(c_0_18,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_19,plain,
! [X23,X24] :
( tptptypes_5_387(X23,X24)
| ~ tptptypes_6_388(X23,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_99])])]) ).
cnf(c_0_20,plain,
( ~ tptptypes_7_389(X1,X2)
| tptptypes_6_388(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ tptptypes_8_390(X1,X2)
| tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ mtvisible(c_cyclistsmt)
| tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
( ~ tptptypes_6_388(X1,X2)
| tptptypes_5_387(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ tptptypes_8_390(X2,X1)
| tptptypes_6_388(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR062+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.10/0.35 % Computer : n012.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 14:40:36 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.10/0.43 % Starting new_bool_3 with 600s (2) cores
% 0.10/0.43 % Starting new_bool_1 with 600s (2) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % new_bool_3 with pid 2582560 completed with status 0
% 0.10/0.43 % Result found by new_bool_3
% 0.10/0.43 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.10/0.43 % Starting new_bool_3 with 600s (2) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.10/0.43 % Starting SubtermCWHack with 61s (1) cores
% 0.10/0.43 % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 2582564 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.10/0.43 % Starting new_bool_3 with 600s (2) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.10/0.43 % Starting SubtermCWHack with 61s (1) cores
% 0.10/0.43 % Preprocessing time : 0.003 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 1132
% 0.10/0.43 % Removed by relevancy pruning/SinE : 1109
% 0.10/0.43 % Initial clauses : 24
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 24
% 0.10/0.43 % Processed clauses : 36
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 4
% 0.10/0.43 % ...remaining for further processing : 32
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 3
% 0.10/0.43 % Generated clauses : 14
% 0.10/0.43 % ...of the previous two non-redundant : 13
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 14
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 7
% 0.10/0.43 % ...of those cached : 2
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 29
% 0.10/0.43 % Positive orientable unit clauses : 8
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 2
% 0.10/0.43 % Non-unit-clauses : 19
% 0.10/0.43 % Current number of unprocessed clauses: 1
% 0.10/0.43 % ...number of literals in the above : 3
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 3
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 29
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 20
% 0.10/0.43 % Non-unit clause-clause subsumptions : 4
% 0.10/0.43 % Unit Clause-clause subsumption calls : 15
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 1
% 0.10/0.43 % BW rewrite match successes : 1
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 8569
% 0.10/0.43 % Search garbage collected termcells : 4954
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.009 s
% 0.10/0.43 % System time : 0.003 s
% 0.10/0.43 % Total time : 0.013 s
% 0.10/0.43 % Maximum resident set size: 5836 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.025 s
% 0.10/0.43 % System time : 0.013 s
% 0.10/0.43 % Total time : 0.037 s
% 0.10/0.43 % Maximum resident set size: 5632 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------