%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR030+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 : n002.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.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 11 |; 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 : 23 ( 2 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query30,conjecture,
? [X2] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X2,c_pushingwithopenhand) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query30) ).
fof(just9,axiom,
! [X1,X2] :
( tptptypes_7_389(X1,X2)
=> tptptypes_6_388(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just9) ).
fof(just12,axiom,
( mtvisible(c_tptp_spindleheadmt)
=> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just12) ).
fof(just49,axiom,
! [X15,X16] :
( ( genlmt(X15,X16)
& mtvisible(X15) )
=> mtvisible(X16) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just49) ).
fof(just7,axiom,
! [X1,X2] :
( tptptypes_6_388(X1,X2)
=> tptptypes_5_387(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just7) ).
fof(just11,axiom,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just11) ).
fof(c_0_6,negated_conjecture,
~ ? [X2] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X2,c_pushingwithopenhand) ),
inference(assume_negation,[status(cth)],[query30]) ).
fof(c_0_7,plain,
! [X26,X27] :
( tptptypes_6_388(X27,X26)
| ~ tptptypes_7_389(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])])]) ).
fof(c_0_8,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[just12])]) ).
fof(c_0_9,plain,
! [X24,X25] :
( mtvisible(X25)
| ~ genlmt(X24,X25)
| ~ mtvisible(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just49])])]) ).
fof(c_0_10,negated_conjecture,
! [X17] :
( ~ tptptypes_5_387(X17,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_11,plain,
! [X18,X19] :
( tptptypes_5_387(X18,X19)
| ~ tptptypes_6_388(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just7])])]) ).
cnf(c_0_12,plain,
( ~ tptptypes_7_389(X1,X2)
| tptptypes_6_388(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[just11]) ).
cnf(c_0_16,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ tptptypes_6_388(X1,X2)
| tptptypes_5_387(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR030+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.13/0.38 % Computer : n002.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 14:28:18 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.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.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % new_bool_1 with pid 3515721 completed with status 0
% 0.13/0.45 % Result found by new_bool_1
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 3515724 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % Preprocessing time : 0.001 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Theorem
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 58
% 0.13/0.45 % Removed by relevancy pruning/SinE : 41
% 0.13/0.45 % Initial clauses : 18
% 0.13/0.45 % Removed in clause preprocessing : 0
% 0.13/0.45 % Initial clauses in saturation : 18
% 0.13/0.45 % Processed clauses : 27
% 0.13/0.45 % ...of these trivial : 0
% 0.13/0.45 % ...subsumed : 2
% 0.13/0.45 % ...remaining for further processing : 24
% 0.13/0.45 % Other redundant clauses eliminated : 0
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 0
% 0.13/0.45 % Backward-rewritten : 4
% 0.13/0.45 % Generated clauses : 12
% 0.13/0.45 % ...of the previous two non-redundant : 15
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 12
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 0
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 5
% 0.13/0.45 % ...of those cached : 3
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 20
% 0.13/0.45 % Positive orientable unit clauses : 7
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 2
% 0.13/0.45 % Non-unit-clauses : 11
% 0.13/0.45 % Current number of unprocessed clauses: 6
% 0.13/0.45 % ...number of literals in the above : 12
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 4
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 30
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 24
% 0.13/0.45 % Non-unit clause-clause subsumptions : 2
% 0.13/0.45 % Unit Clause-clause subsumption calls : 0
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 1
% 0.13/0.45 % BW rewrite match successes : 1
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 1342
% 0.13/0.45 % Search garbage collected termcells : 371
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.003 s
% 0.13/0.45 % System time : 0.003 s
% 0.13/0.45 % Total time : 0.006 s
% 0.13/0.45 % Maximum resident set size: 3684 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.005 s
% 0.13/0.45 % System time : 0.008 s
% 0.13/0.45 % Total time : 0.013 s
% 0.13/0.45 % Maximum resident set size: 4608 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------