TSTP Solution File: CSR073+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR073+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:32:09 EDT 2024
% Result : Theorem 26.51s 27.00s
% Output : CNFRefutation 26.51s
% 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/sandbox2/tmp/tmp.fVwdzfQLKK/E---3.1_19598.p',query223) ).
fof(ax3_26515,axiom,
! [X2,X3] :
( tptptypes_8_400(X2,X3)
=> tptptypes_7_396(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.fVwdzfQLKK/E---3.1_19598.p',ax3_26515) ).
fof(ax3_2560,axiom,
! [X2,X3] :
( tptptypes_9_401(X2,X3)
=> tptptypes_8_400(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fVwdzfQLKK/E---3.1_19598.p',ax3_2560) ).
fof(ax3_11372,axiom,
! [X2,X3] :
( tptptypes_6_388(X2,X3)
=> tptptypes_5_387(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.fVwdzfQLKK/E---3.1_19598.p',ax3_11372) ).
fof(ax3_16571,axiom,
! [X2,X3] :
( tptptypes_7_396(X2,X3)
=> tptptypes_6_388(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.fVwdzfQLKK/E---3.1_19598.p',ax3_16571) ).
fof(ax3_27254,axiom,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
file('/export/starexec/sandbox2/tmp/tmp.fVwdzfQLKK/E---3.1_19598.p',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_8_400(X91,X92)
| tptptypes_7_396(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_9_401(X61,X62)
| tptptypes_8_400(X62,X61) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_2560])])]) ).
fof(c_0_9,negated_conjecture,
! [X24] :
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptptypes_5_387(X24,c_pushingababycarriage) ),
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_6_388(X27,X28)
| tptptypes_5_387(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_7_396(X47,X48)
| tptptypes_6_388(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_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( tptptypes_8_400(X2,X1)
| ~ tptptypes_9_401(X1,X2) ),
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_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
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_6_388(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
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
% 13.00/13.06 % Problem : CSR073+4 : TPTP v8.1.2. Released v3.4.0.
% 13.00/13.07 % Command : run_E %s %d THM
% 13.06/13.28 % Computer : n024.cluster.edu
% 13.06/13.28 % Model : x86_64 x86_64
% 13.06/13.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 13.06/13.28 % Memory : 8042.1875MB
% 13.06/13.28 % OS : Linux 3.10.0-693.el7.x86_64
% 13.06/13.28 % CPULimit : 300
% 13.06/13.28 % WCLimit : 300
% 13.06/13.28 % DateTime : Fri May 3 14:44:06 EDT 2024
% 13.06/13.29 % CPUTime :
% 26.14/26.35 Running first-order theorem proving
% 26.14/26.35 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/tmp/tmp.fVwdzfQLKK/E---3.1_19598.p
% 26.51/27.00 # Version: 3.1.0
% 26.51/27.00 # Preprocessing class: FMLLLMSLSSSNFFN.
% 26.51/27.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.51/27.00 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 26.51/27.00 # Starting new_bool_3 with 300s (1) cores
% 26.51/27.00 # Starting new_bool_1 with 300s (1) cores
% 26.51/27.00 # Starting sh5l with 300s (1) cores
% 26.51/27.00 # sh5l with pid 19709 completed with status 0
% 26.51/27.00 # Result found by sh5l
% 26.51/27.00 # Preprocessing class: FMLLLMSLSSSNFFN.
% 26.51/27.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.51/27.00 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 26.51/27.00 # Starting new_bool_3 with 300s (1) cores
% 26.51/27.00 # Starting new_bool_1 with 300s (1) cores
% 26.51/27.00 # Starting sh5l with 300s (1) cores
% 26.51/27.00 # SinE strategy is gf500_gu_R04_F100_L20000
% 26.51/27.00 # Search class: FHUNM-FFMM31-MFFFFFNN
% 26.51/27.00 # partial match(1): FHUNM-FFMS31-MFFFFFNN
% 26.51/27.00 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 26.51/27.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 26.51/27.00 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19712 completed with status 0
% 26.51/27.00 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 26.51/27.00 # Preprocessing class: FMLLLMSLSSSNFFN.
% 26.51/27.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.51/27.00 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 26.51/27.00 # Starting new_bool_3 with 300s (1) cores
% 26.51/27.00 # Starting new_bool_1 with 300s (1) cores
% 26.51/27.00 # Starting sh5l with 300s (1) cores
% 26.51/27.00 # SinE strategy is gf500_gu_R04_F100_L20000
% 26.51/27.00 # Search class: FHUNM-FFMM31-MFFFFFNN
% 26.51/27.00 # partial match(1): FHUNM-FFMS31-MFFFFFNN
% 26.51/27.00 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 26.51/27.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 26.51/27.00 # Preprocessing time : 0.021 s
% 26.51/27.00 # Presaturation interreduction done
% 26.51/27.00
% 26.51/27.00 # Proof found!
% 26.51/27.00 # SZS status Theorem
% 26.51/27.00 # SZS output start CNFRefutation
% See solution above
% 26.51/27.00 # Parsed axioms : 44217
% 26.51/27.00 # Removed by relevancy pruning/SinE : 43936
% 26.51/27.00 # Initial clauses : 282
% 26.51/27.00 # Removed in clause preprocessing : 0
% 26.51/27.00 # Initial clauses in saturation : 282
% 26.51/27.00 # Processed clauses : 1176
% 26.51/27.00 # ...of these trivial : 23
% 26.51/27.00 # ...subsumed : 232
% 26.51/27.00 # ...remaining for further processing : 921
% 26.51/27.00 # Other redundant clauses eliminated : 0
% 26.51/27.00 # Clauses deleted for lack of memory : 0
% 26.51/27.00 # Backward-subsumed : 0
% 26.51/27.00 # Backward-rewritten : 6
% 26.51/27.00 # Generated clauses : 1012
% 26.51/27.00 # ...of the previous two non-redundant : 801
% 26.51/27.00 # ...aggressively subsumed : 0
% 26.51/27.00 # Contextual simplify-reflections : 0
% 26.51/27.00 # Paramodulations : 1010
% 26.51/27.00 # Factorizations : 0
% 26.51/27.00 # NegExts : 0
% 26.51/27.00 # Equation resolutions : 0
% 26.51/27.00 # Disequality decompositions : 0
% 26.51/27.00 # Total rewrite steps : 204
% 26.51/27.00 # ...of those cached : 120
% 26.51/27.00 # Propositional unsat checks : 0
% 26.51/27.00 # Propositional check models : 0
% 26.51/27.00 # Propositional check unsatisfiable : 0
% 26.51/27.00 # Propositional clauses : 0
% 26.51/27.00 # Propositional clauses after purity: 0
% 26.51/27.00 # Propositional unsat core size : 0
% 26.51/27.00 # Propositional preprocessing time : 0.000
% 26.51/27.00 # Propositional encoding time : 0.000
% 26.51/27.00 # Propositional solver time : 0.000
% 26.51/27.00 # Success case prop preproc time : 0.000
% 26.51/27.00 # Success case prop encoding time : 0.000
% 26.51/27.00 # Success case prop solver time : 0.000
% 26.51/27.00 # Current number of processed clauses : 659
% 26.51/27.00 # Positive orientable unit clauses : 217
% 26.51/27.00 # Positive unorientable unit clauses: 0
% 26.51/27.00 # Negative unit clauses : 4
% 26.51/27.00 # Non-unit-clauses : 438
% 26.51/27.00 # Current number of unprocessed clauses: 159
% 26.51/27.00 # ...number of literals in the above : 354
% 26.51/27.00 # Current number of archived formulas : 0
% 26.51/27.00 # Current number of archived clauses : 262
% 26.51/27.00 # Clause-clause subsumption calls (NU) : 35929
% 26.51/27.00 # Rec. Clause-clause subsumption calls : 33687
% 26.51/27.00 # Non-unit clause-clause subsumptions : 232
% 26.51/27.00 # Unit Clause-clause subsumption calls : 773
% 26.51/27.00 # Rewrite failures with RHS unbound : 0
% 26.51/27.00 # BW rewrite match attempts : 117
% 26.51/27.00 # BW rewrite match successes : 3
% 26.51/27.00 # Condensation attempts : 0
% 26.51/27.00 # Condensation successes : 0
% 26.51/27.00 # Termbank termtop insertions : 310717
% 26.51/27.00 # Search garbage collected termcells : 157677
% 26.51/27.00
% 26.51/27.00 # -------------------------------------------------
% 26.51/27.00 # User time : 0.190 s
% 26.51/27.00 # System time : 0.092 s
% 26.51/27.00 # Total time : 0.282 s
% 26.51/27.00 # Maximum resident set size: 82220 pages
% 26.51/27.00
% 26.51/27.00 # -------------------------------------------------
% 26.51/27.00 # User time : 0.501 s
% 26.51/27.00 # System time : 0.116 s
% 26.51/27.00 # Total time : 0.617 s
% 26.51/27.00 # Maximum resident set size: 34600 pages
% 26.51/27.00 % E---3.1 exiting
% 26.51/27.00 % E exiting
%------------------------------------------------------------------------------