%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR030+2 : 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:59 PM UTC 2026
% Result : Theorem 0.15s 5.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 15 ~; 10 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 24 ( 3 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query80,conjecture,
? [X6] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X6,c_pushingwithopenhand) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query80) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( genlmt(X20,X21)
& mtvisible(X20) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).
fof(ax1_99,axiom,
! [X5,X6] :
( tptptypes_6_388(X5,X6)
=> tptptypes_5_387(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_99) ).
fof(ax1_451,axiom,
( mtvisible(c_tptp_spindleheadmt)
=> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_451) ).
fof(ax1_133,axiom,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_133) ).
fof(ax1_302,axiom,
! [X5,X6] :
( tptptypes_7_389(X5,X6)
=> tptptypes_6_388(X6,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_302) ).
fof(c_0_6,negated_conjecture,
~ ? [X6] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X6,c_pushingwithopenhand) ),
inference(assume_negation,[status(cth)],[query80]) ).
fof(c_0_7,plain,
! [X31,X32] :
( mtvisible(X32)
| ~ genlmt(X31,X32)
| ~ mtvisible(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).
fof(c_0_8,negated_conjecture,
! [X22] :
( ~ tptptypes_5_387(X22,c_pushingwithopenhand)
& mtvisible(c_tptp_member3393_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,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])])]) ).
fof(c_0_10,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_451])]) ).
cnf(c_0_11,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_133]) ).
cnf(c_0_13,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ tptptypes_6_388(X1,X2)
| tptptypes_5_387(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X33,X34] :
( tptptypes_6_388(X34,X33)
| ~ tptptypes_7_389(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_302])])]) ).
cnf(c_0_17,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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])]) ).
cnf(c_0_19,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ tptptypes_7_389(X1,X2)
| tptptypes_6_388(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR030+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.39 % Computer : n018.cluster.edu
% 0.10/5.39 % Model : x86_64 x86_64
% 0.10/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39 % Memory : 8046.5625MB
% 0.10/5.39 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Mon Sep 21 14:28:05 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.47 % Version: 3.5.1
% 0.15/5.47 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.15/5.47 % Starting new_bool_3 with 600s (2) cores
% 0.15/5.47 % Starting new_bool_1 with 600s (2) cores
% 0.15/5.47 % Starting sh5l with 300s (1) cores
% 0.15/5.47 % sh5l with pid 2134379 completed with status 0
% 0.15/5.47 % Result found by sh5l
% 0.15/5.47 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.15/5.47 % Starting new_bool_3 with 600s (2) cores
% 0.15/5.47 % Starting new_bool_1 with 600s (2) cores
% 0.15/5.47 % Starting sh5l with 300s (1) cores
% 0.15/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.47 % Search class: FHUNM-FFMM33-SFFFFFNN
% 0.15/5.47 % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.15/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.47 % SubtermCWHack with pid 2134380 completed with status 0
% 0.15/5.47 % Result found by SubtermCWHack
% 0.15/5.47 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.15/5.47 % Starting new_bool_3 with 600s (2) cores
% 0.15/5.47 % Starting new_bool_1 with 600s (2) cores
% 0.15/5.47 % Starting sh5l with 300s (1) cores
% 0.15/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.47 % Search class: FHUNM-FFMM33-SFFFFFNN
% 0.15/5.47 % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.15/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.47 % Preprocessing time : 0.002 s
% 0.15/5.47
% 0.15/5.47 % Proof found!
% 0.15/5.47 % SZS status Theorem
% 0.15/5.47 % SZS output start CNFRefutation
% See solution above
% 0.15/5.47 % Parsed axioms : 1132
% 0.15/5.47 % Removed by relevancy pruning/SinE : 1067
% 0.15/5.47 % Initial clauses : 66
% 0.15/5.47 % Removed in clause preprocessing : 0
% 0.15/5.47 % Initial clauses in saturation : 66
% 0.15/5.47 % Processed clauses : 61
% 0.15/5.47 % ...of these trivial : 0
% 0.15/5.47 % ...subsumed : 4
% 0.15/5.47 % ...remaining for further processing : 57
% 0.15/5.47 % Other redundant clauses eliminated : 0
% 0.15/5.47 % Clauses deleted for lack of memory : 0
% 0.15/5.47 % Backward-subsumed : 0
% 0.15/5.47 % Backward-rewritten : 3
% 0.15/5.47 % Generated clauses : 30
% 0.15/5.47 % ...of the previous two non-redundant : 24
% 0.15/5.47 % ...aggressively subsumed : 0
% 0.15/5.47 % Contextual simplify-reflections : 0
% 0.15/5.47 % Paramodulations : 29
% 0.15/5.47 % Factorizations : 0
% 0.15/5.47 % NegExts : 0
% 0.15/5.47 % Equation resolutions : 0
% 0.15/5.47 % Disequality decompositions : 0
% 0.15/5.47 % Total rewrite steps : 6
% 0.15/5.47 % ...of those cached : 2
% 0.15/5.47 % Propositional unsat checks : 0
% 0.15/5.47 % Propositional check models : 0
% 0.15/5.47 % Propositional check unsatisfiable : 0
% 0.15/5.47 % Propositional clauses : 0
% 0.15/5.47 % Propositional clauses after purity: 0
% 0.15/5.47 % Propositional unsat core size : 0
% 0.15/5.47 % Propositional preprocessing time : 0.000
% 0.15/5.47 % Propositional encoding time : 0.000
% 0.15/5.47 % Propositional solver time : 0.000
% 0.15/5.47 % Success case prop preproc time : 0.000
% 0.15/5.47 % Success case prop encoding time : 0.000
% 0.15/5.47 % Success case prop solver time : 0.000
% 0.15/5.47 % Current number of processed clauses : 53
% 0.15/5.47 % Positive orientable unit clauses : 13
% 0.15/5.47 % Positive unorientable unit clauses: 0
% 0.15/5.47 % Negative unit clauses : 3
% 0.15/5.47 % Non-unit-clauses : 37
% 0.15/5.47 % Current number of unprocessed clauses: 29
% 0.15/5.47 % ...number of literals in the above : 60
% 0.15/5.47 % Current number of archived formulas : 0
% 0.15/5.47 % Current number of archived clauses : 4
% 0.15/5.47 % Clause-clause subsumption calls (NU) : 259
% 0.15/5.47 % Rec. Clause-clause subsumption calls : 232
% 0.15/5.47 % Non-unit clause-clause subsumptions : 4
% 0.15/5.47 % Unit Clause-clause subsumption calls : 63
% 0.15/5.47 % Rewrite failures with RHS unbound : 0
% 0.15/5.47 % BW rewrite match attempts : 1
% 0.15/5.47 % BW rewrite match successes : 1
% 0.15/5.47 % Condensation attempts : 0
% 0.15/5.47 % Condensation successes : 0
% 0.15/5.47 % Termbank termtop insertions : 10797
% 0.15/5.47 % Search garbage collected termcells : 5026
% 0.15/5.47
% 0.15/5.47 % -------------------------------------------------
% 0.15/5.47 % User time : 0.005 s
% 0.15/5.47 % System time : 0.007 s
% 0.15/5.47 % Total time : 0.012 s
% 0.15/5.47 % Maximum resident set size: 6144 pages
% 0.15/5.47
% 0.15/5.47 % -------------------------------------------------
% 0.15/5.47 % User time : 0.013 s
% 0.15/5.47 % System time : 0.013 s
% 0.15/5.47 % Total time : 0.026 s
% 0.15/5.47 % Maximum resident set size: 5888 pages
% 0.15/5.47 % E exiting
%------------------------------------------------------------------------------