%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR073+4 : 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 : 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:33 PM UTC 2026
% Result : Theorem 0.60s 0.92s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 32 ( 15 ~; 10 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 34 ( 3 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query223,conjecture,
? [X2] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X2,c_pushingababycarriage) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query223) ).
fof(ax3_26515,axiom,
! [X2,X3] :
( tptptypes_8_400(X2,X3)
=> tptptypes_7_396(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_26515) ).
fof(ax3_2560,axiom,
! [X2,X3] :
( tptptypes_9_401(X2,X3)
=> tptptypes_8_400(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_2560) ).
fof(ax3_11372,axiom,
! [X2,X3] :
( tptptypes_6_388(X2,X3)
=> tptptypes_5_387(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_11372) ).
fof(ax3_16571,axiom,
! [X2,X3] :
( tptptypes_7_396(X2,X3)
=> tptptypes_6_388(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_16571) ).
fof(ax3_27254,axiom,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_27254) ).
fof(c_0_6,negated_conjecture,
~ ? [X2] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X2,c_pushingababycarriage) ),
inference(assume_negation,[status(cth)],[query223]) ).
fof(c_0_7,plain,
! [X91,X92] :
( tptptypes_7_396(X91,X92)
| ~ tptptypes_8_400(X91,X92) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_26515])])]) ).
fof(c_0_8,plain,
! [X61,X62] :
( tptptypes_8_400(X62,X61)
| ~ tptptypes_9_401(X61,X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_2560])])]) ).
fof(c_0_9,negated_conjecture,
! [X24] :
( ~ tptptypes_5_387(X24,c_pushingababycarriage)
& mtvisible(c_tptp_spindlecollectormt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X27,X28] :
( tptptypes_5_387(X27,X28)
| ~ tptptypes_6_388(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_11372])])]) ).
fof(c_0_11,plain,
! [X47,X48] :
( tptptypes_6_388(X47,X48)
| ~ tptptypes_7_396(X47,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_16571])])]) ).
cnf(c_0_12,plain,
( ~ tptptypes_8_400(X1,X2)
| tptptypes_7_396(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ tptptypes_9_401(X1,X2)
| tptptypes_8_400(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ tptptypes_6_388(X1,X2)
| tptptypes_5_387(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ tptptypes_7_396(X1,X2)
| tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ tptptypes_9_401(X2,X1)
| tptptypes_7_396(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ tptptypes_9_401(X2,X1)
| tptptypes_6_388(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
inference(split_conjunct,[status(thm)],[ax3_27254]) ).
cnf(c_0_21,negated_conjecture,
~ tptptypes_9_401(c_pushingababycarriage,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CSR073+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 14:45:51 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.60/0.92 % Version: 3.5.1
% 0.60/0.92 % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.60/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.92 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.60/0.92 % Starting new_bool_3 with 300s (1) cores
% 0.60/0.92 % Starting new_bool_1 with 300s (1) cores
% 0.60/0.92 % Starting sh5l with 300s (1) cores
% 0.60/0.92 % sh5l with pid 2587542 completed with status 0
% 0.60/0.92 % Result found by sh5l
% 0.60/0.92 % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.60/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.92 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.60/0.92 % Starting new_bool_3 with 300s (1) cores
% 0.60/0.92 % Starting new_bool_1 with 300s (1) cores
% 0.60/0.92 % Starting sh5l with 300s (1) cores
% 0.60/0.92 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.60/0.92 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.60/0.92 % Search class: FHUNM-FFMM31-MFFFFFNN
% 0.60/0.92 % partial match(1): FHUNM-FFMS31-MFFFFFNN
% 0.60/0.92 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.60/0.92 % Starting SubtermCWHack with 31s (1) cores
% 0.60/0.92 % SubtermCWHack with pid 2587545 completed with status 0
% 0.60/0.92 % Result found by SubtermCWHack
% 0.60/0.92 % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.60/0.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.92 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.60/0.92 % Starting new_bool_3 with 300s (1) cores
% 0.60/0.92 % Starting new_bool_1 with 300s (1) cores
% 0.60/0.92 % Starting sh5l with 300s (1) cores
% 0.60/0.92 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.60/0.92 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.60/0.92 % Search class: FHUNM-FFMM31-MFFFFFNN
% 0.60/0.92 % partial match(1): FHUNM-FFMS31-MFFFFFNN
% 0.60/0.92 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.60/0.92 % Starting SubtermCWHack with 31s (1) cores
% 0.60/0.92 % Preprocessing time : 0.011 s
% 0.60/0.92
% 0.60/0.92 % Proof found!
% 0.60/0.92 % SZS status Theorem
% 0.60/0.92 % SZS output start CNFRefutation
% See solution above
% 0.60/0.92 % Parsed axioms : 44217
% 0.60/0.92 % Removed by relevancy pruning/SinE : 43936
% 0.60/0.92 % Initial clauses : 282
% 0.60/0.92 % Removed in clause preprocessing : 0
% 0.60/0.92 % Initial clauses in saturation : 282
% 0.60/0.92 % Processed clauses : 325
% 0.60/0.92 % ...of these trivial : 19
% 0.60/0.92 % ...subsumed : 32
% 0.60/0.92 % ...remaining for further processing : 274
% 0.60/0.92 % Other redundant clauses eliminated : 0
% 0.60/0.92 % Clauses deleted for lack of memory : 0
% 0.60/0.92 % Backward-subsumed : 0
% 0.60/0.92 % Backward-rewritten : 7
% 0.60/0.92 % Generated clauses : 154
% 0.60/0.92 % ...of the previous two non-redundant : 121
% 0.60/0.92 % ...aggressively subsumed : 0
% 0.60/0.92 % Contextual simplify-reflections : 0
% 0.60/0.92 % Paramodulations : 152
% 0.60/0.92 % Factorizations : 0
% 0.60/0.92 % NegExts : 0
% 0.60/0.92 % Equation resolutions : 0
% 0.60/0.92 % Disequality decompositions : 0
% 0.60/0.92 % Total rewrite steps : 51
% 0.60/0.92 % ...of those cached : 26
% 0.60/0.92 % Propositional unsat checks : 0
% 0.60/0.92 % Propositional check models : 0
% 0.60/0.92 % Propositional check unsatisfiable : 0
% 0.60/0.92 % Propositional clauses : 0
% 0.60/0.92 % Propositional clauses after purity: 0
% 0.60/0.92 % Propositional unsat core size : 0
% 0.60/0.92 % Propositional preprocessing time : 0.000
% 0.60/0.92 % Propositional encoding time : 0.000
% 0.60/0.92 % Propositional solver time : 0.000
% 0.60/0.92 % Success case prop preproc time : 0.000
% 0.60/0.92 % Success case prop encoding time : 0.000
% 0.60/0.92 % Success case prop solver time : 0.000
% 0.60/0.92 % Current number of processed clauses : 265
% 0.60/0.92 % Positive orientable unit clauses : 131
% 0.60/0.92 % Positive unorientable unit clauses: 0
% 0.60/0.92 % Negative unit clauses : 4
% 0.60/0.92 % Non-unit-clauses : 130
% 0.60/0.92 % Current number of unprocessed clauses: 78
% 0.60/0.92 % ...number of literals in the above : 131
% 0.60/0.92 % Current number of archived formulas : 0
% 0.60/0.92 % Current number of archived clauses : 9
% 0.60/0.92 % Clause-clause subsumption calls (NU) : 2412
% 0.60/0.92 % Rec. Clause-clause subsumption calls : 2326
% 0.60/0.92 % Non-unit clause-clause subsumptions : 32
% 0.60/0.92 % Unit Clause-clause subsumption calls : 400
% 0.60/0.92 % Rewrite failures with RHS unbound : 0
% 0.60/0.92 % BW rewrite match attempts : 3
% 0.60/0.92 % BW rewrite match successes : 3
% 0.60/0.92 % Condensation attempts : 0
% 0.60/0.92 % Condensation successes : 0
% 0.60/0.92 % Termbank termtop insertions : 302621
% 0.60/0.92 % Search garbage collected termcells : 157677
% 0.60/0.92
% 0.60/0.92 % -------------------------------------------------
% 0.60/0.92 % User time : 0.118 s
% 0.60/0.92 % System time : 0.074 s
% 0.60/0.92 % Total time : 0.192 s
% 0.60/0.92 % Maximum resident set size: 84532 pages
% 0.60/0.92
% 0.60/0.92 % -------------------------------------------------
% 0.60/0.92 % User time : 0.438 s
% 0.60/0.92 % System time : 0.114 s
% 0.60/0.92 % Total time : 0.552 s
% 0.60/0.92 % Maximum resident set size: 37888 pages
% 0.60/0.92 % E exiting
%------------------------------------------------------------------------------