TSTP Solution File: LCL415-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL415-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 08:18:48 EDT 2024
% Result : Satisfiable 0.21s 0.50s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_4,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_3,
[final] ).
cnf(c_0_5,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,implies(implies(X3,X1),X4)),implies(X1,X4)))),
candidate,
[final] ).
cnf(c_0_6,plain,
( is_a_theorem(implies(implies(X1,implies(implies(X2,X3),X4)),implies(X3,X4)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]),
[final] ).
cnf(c_0_7,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,implies(implies(X4,X1),X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]),
[final] ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3)))
| ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]),
[final] ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X3,X2),X4)),implies(X2,implies(implies(X3,X2),X4))))
| ~ is_a_theorem(implies(X2,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]),
[final] ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X1),X3)))
| ~ is_a_theorem(implies(implies(X4,X1),implies(implies(X2,X1),X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]),
[final] ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(implies(X1,X2),X3),implies(implies(X1,X2),X3)),implies(X2,X3))))
| ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,implies(implies(X1,X2),X3)))) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]),
[final] ).
cnf(c_0_12,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),X3),implies(implies(X1,X2),X3)),implies(X2,X3)))
| ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,implies(implies(X1,X2),X3))))
| ~ is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_4,c_0_11]),
[final] ).
cnf(c_0_13,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),X2),implies(implies(X1,X2),X2)),implies(X2,implies(implies(X1,X2),X2))))
| ~ is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(implies(X1,X2),X2))))
| ~ is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_12]),
[final] ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,implies(implies(X2,implies(X3,X1)),implies(X3,X1))))
| ~ is_a_theorem(implies(implies(implies(X2,implies(X3,X1)),implies(X3,X1)),implies(implies(X3,X1),implies(implies(X2,implies(X3,X1)),implies(X3,X1)))))
| ~ is_a_theorem(implies(X1,implies(implies(implies(X2,implies(X3,X1)),implies(X3,X1)),implies(implies(X2,implies(X3,X1)),implies(X3,X1)))))
| ~ is_a_theorem(implies(implies(X2,implies(X3,X1)),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]),
[final] ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(X3,implies(X4,X1)),X2),implies(implies(X4,X1),implies(implies(X3,implies(X4,X1)),X2))))
| ~ is_a_theorem(implies(X1,implies(implies(implies(X3,implies(X4,X1)),X2),implies(implies(X3,implies(X4,X1)),X2))))
| ~ is_a_theorem(implies(implies(X3,implies(X4,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]),
[final] ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(X3,X1),X2),implies(X1,implies(implies(X3,X1),X2))))
| ~ is_a_theorem(implies(implies(implies(X3,X1),X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]),
[final] ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(implies(X2,implies(X3,X1)),X4)))
| ~ is_a_theorem(implies(X1,implies(implies(X5,implies(X3,X1)),implies(implies(X2,implies(X3,X1)),X4))))
| ~ is_a_theorem(implies(implies(X3,X1),implies(X5,implies(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]),
[final] ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,implies(implies(X4,implies(X5,X1)),X2))))
| ~ is_a_theorem(implies(implies(X5,X1),X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]),
[final] ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
c_0_14,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL415-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 09:32:45 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.UdQors4nLf/E---3.1_15239.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 15318 completed with status 1
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.21/0.50 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 15322 completed with status 1
% 0.21/0.50 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # No proof found!
% 0.21/0.50 # SZS status Satisfiable
% 0.21/0.50 # SZS output start Saturation
% See solution above
% 0.21/0.50 # Parsed axioms : 3
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 3
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 3
% 0.21/0.50 # Processed clauses : 20
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 4
% 0.21/0.50 # ...remaining for further processing : 16
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 17
% 0.21/0.50 # ...of the previous two non-redundant : 17
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 17
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 0
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 16
% 0.21/0.50 # Positive orientable unit clauses : 1
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 14
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 0
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 153
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 147
% 0.21/0.50 # Non-unit clause-clause subsumptions : 4
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 901
% 0.21/0.50 # Search garbage collected termcells : 8
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1628 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1696 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------