TSTP Solution File: CSR030+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR030+4 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Mon May 20 19:13:17 EDT 2024
% Result : Theorem 1.98s 1.30s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 16 ~; 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(query180,conjecture,
? [X3] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X3,c_pushingwithopenhand) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query180) ).
fof(ax3_11372,axiom,
! [X2,X3] :
( tptptypes_6_388(X2,X3)
=> tptptypes_5_387(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_11372) ).
fof(ax3_6493,axiom,
! [X2,X3] :
( tptptypes_7_389(X2,X3)
=> tptptypes_6_388(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_6493) ).
fof(ax3_10816,axiom,
( mtvisible(c_tptp_spindleheadmt)
=> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_10816) ).
fof(ax3_44208,axiom,
! [X22,X23] :
( ( mtvisible(X22)
& genlmt(X22,X23) )
=> mtvisible(X23) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_44208) ).
fof(ax3_14388,axiom,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_14388) ).
fof(c_0_6,negated_conjecture,
~ ? [X3] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X3,c_pushingwithopenhand) ),
inference(assume_negation,[status(cth)],[query180]) ).
fof(c_0_7,negated_conjecture,
! [X24] :
( mtvisible(c_tptp_member3393_mt)
& ~ tptptypes_5_387(X24,c_pushingwithopenhand) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,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])])]) ).
cnf(c_0_9,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X43,X44] :
( ~ tptptypes_7_389(X43,X44)
| tptptypes_6_388(X44,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_6493])])]) ).
cnf(c_0_12,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( tptptypes_6_388(X2,X1)
| ~ tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_10816])]) ).
fof(c_0_15,plain,
! [X37,X38] :
( ~ mtvisible(X37)
| ~ genlmt(X37,X38)
| mtvisible(X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])])]) ).
cnf(c_0_16,negated_conjecture,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax3_14388]) ).
cnf(c_0_20,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
~ mtvisible(c_tptp_spindleheadmt),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR030+4 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 01:16:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.48 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
% 1.98/1.30 # Version: 3.1.0
% 1.98/1.30 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.98/1.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/1.30 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.98/1.30 # Starting new_bool_3 with 300s (1) cores
% 1.98/1.30 # Starting new_bool_1 with 300s (1) cores
% 1.98/1.30 # Starting sh5l with 300s (1) cores
% 1.98/1.30 # sh5l with pid 18638 completed with status 0
% 1.98/1.30 # Result found by sh5l
% 1.98/1.30 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.98/1.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/1.30 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.98/1.30 # Starting new_bool_3 with 300s (1) cores
% 1.98/1.30 # Starting new_bool_1 with 300s (1) cores
% 1.98/1.30 # Starting sh5l with 300s (1) cores
% 1.98/1.30 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.98/1.30 # Search class: FHUNM-FFMM31-MFFFFFNN
% 1.98/1.30 # partial match(1): FHUNM-FFMS31-MFFFFFNN
% 1.98/1.30 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.98/1.30 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.98/1.30 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 18645 completed with status 0
% 1.98/1.30 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.98/1.30 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.98/1.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/1.30 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.98/1.30 # Starting new_bool_3 with 300s (1) cores
% 1.98/1.30 # Starting new_bool_1 with 300s (1) cores
% 1.98/1.30 # Starting sh5l with 300s (1) cores
% 1.98/1.30 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.98/1.30 # Search class: FHUNM-FFMM31-MFFFFFNN
% 1.98/1.30 # partial match(1): FHUNM-FFMS31-MFFFFFNN
% 1.98/1.30 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.98/1.30 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.98/1.30 # Preprocessing time : 0.016 s
% 1.98/1.30 # Presaturation interreduction done
% 1.98/1.30
% 1.98/1.30 # Proof found!
% 1.98/1.30 # SZS status Theorem
% 1.98/1.30 # SZS output start CNFRefutation
% See solution above
% 1.98/1.30 # Parsed axioms : 44217
% 1.98/1.30 # Removed by relevancy pruning/SinE : 43941
% 1.98/1.30 # Initial clauses : 277
% 1.98/1.30 # Removed in clause preprocessing : 0
% 1.98/1.30 # Initial clauses in saturation : 277
% 1.98/1.30 # Processed clauses : 448
% 1.98/1.30 # ...of these trivial : 19
% 1.98/1.30 # ...subsumed : 17
% 1.98/1.30 # ...remaining for further processing : 412
% 1.98/1.30 # Other redundant clauses eliminated : 0
% 1.98/1.30 # Clauses deleted for lack of memory : 0
% 1.98/1.30 # Backward-subsumed : 11
% 1.98/1.30 # Backward-rewritten : 0
% 1.98/1.30 # Generated clauses : 117
% 1.98/1.30 # ...of the previous two non-redundant : 24
% 1.98/1.30 # ...aggressively subsumed : 0
% 1.98/1.30 # Contextual simplify-reflections : 0
% 1.98/1.30 # Paramodulations : 117
% 1.98/1.30 # Factorizations : 0
% 1.98/1.30 # NegExts : 0
% 1.98/1.30 # Equation resolutions : 0
% 1.98/1.30 # Disequality decompositions : 0
% 1.98/1.30 # Total rewrite steps : 20
% 1.98/1.30 # ...of those cached : 0
% 1.98/1.30 # Propositional unsat checks : 0
% 1.98/1.30 # Propositional check models : 0
% 1.98/1.30 # Propositional check unsatisfiable : 0
% 1.98/1.30 # Propositional clauses : 0
% 1.98/1.30 # Propositional clauses after purity: 0
% 1.98/1.30 # Propositional unsat core size : 0
% 1.98/1.30 # Propositional preprocessing time : 0.000
% 1.98/1.30 # Propositional encoding time : 0.000
% 1.98/1.30 # Propositional solver time : 0.000
% 1.98/1.30 # Success case prop preproc time : 0.000
% 1.98/1.30 # Success case prop encoding time : 0.000
% 1.98/1.30 # Success case prop solver time : 0.000
% 1.98/1.30 # Current number of processed clauses : 153
% 1.98/1.30 # Positive orientable unit clauses : 99
% 1.98/1.30 # Positive unorientable unit clauses: 0
% 1.98/1.30 # Negative unit clauses : 6
% 1.98/1.30 # Non-unit-clauses : 48
% 1.98/1.30 # Current number of unprocessed clauses: 99
% 1.98/1.30 # ...number of literals in the above : 144
% 1.98/1.30 # Current number of archived formulas : 0
% 1.98/1.30 # Current number of archived clauses : 259
% 1.98/1.30 # Clause-clause subsumption calls (NU) : 1756
% 1.98/1.30 # Rec. Clause-clause subsumption calls : 1660
% 1.98/1.30 # Non-unit clause-clause subsumptions : 17
% 1.98/1.30 # Unit Clause-clause subsumption calls : 157
% 1.98/1.30 # Rewrite failures with RHS unbound : 0
% 1.98/1.30 # BW rewrite match attempts : 57
% 1.98/1.30 # BW rewrite match successes : 0
% 1.98/1.30 # Condensation attempts : 0
% 1.98/1.30 # Condensation successes : 0
% 1.98/1.30 # Termbank termtop insertions : 302217
% 1.98/1.30 # Search garbage collected termcells : 157650
% 1.98/1.30
% 1.98/1.30 # -------------------------------------------------
% 1.98/1.30 # User time : 0.177 s
% 1.98/1.30 # System time : 0.082 s
% 1.98/1.30 # Total time : 0.258 s
% 1.98/1.30 # Maximum resident set size: 81540 pages
% 1.98/1.30
% 1.98/1.30 # -------------------------------------------------
% 1.98/1.30 # User time : 0.649 s
% 1.98/1.30 # System time : 0.124 s
% 1.98/1.30 # Total time : 0.773 s
% 1.98/1.30 # Maximum resident set size: 33936 pages
% 1.98/1.30 % E---3.1 exiting
% 1.98/1.30 % E exiting
%------------------------------------------------------------------------------