TSTP Solution File: LCL415-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL415-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:24:49 EDT 2023
% Result : Satisfiable 0.15s 0.41s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named condensed_detachment)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment,
[final] ).
cnf(c_0_4,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,implies(implies(X3,X1),X4)),implies(X1,X4)))),
candidate,
[final] ).
cnf(c_0_5,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_3,c_0_4]),
[final] ).
cnf(c_0_6,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_3,c_0_5]),
[final] ).
cnf(c_0_7,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_6,c_0_4]),
[final] ).
cnf(c_0_8,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_7,c_0_5]),
[final] ).
cnf(c_0_9,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_3,c_0_8]),
[final] ).
cnf(c_0_10,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_9,c_0_4]),
[final] ).
cnf(c_0_11,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_3,c_0_10]),
[final] ).
cnf(c_0_12,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_7,c_0_11]),
[final] ).
cnf(c_0_13,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_6,c_0_12]),
[final] ).
cnf(c_0_14,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_6,c_0_11]),
[final] ).
cnf(c_0_15,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_3,c_0_11]),
[final] ).
cnf(c_0_16,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_6,c_0_8]),
[final] ).
cnf(c_0_17,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_6,c_0_5]),
[final] ).
cnf(c_0_18,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
prove_required_property,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : LCL415-1 : TPTP v8.1.2. Released v2.5.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 12:31:14 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.khqf0UCM66/E---3.1_30287.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 30365 completed with status 1
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.15/0.41 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 30369 completed with status 1
% 0.15/0.41 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41
% 0.15/0.41 # No proof found!
% 0.15/0.41 # SZS status Satisfiable
% 0.15/0.41 # SZS output start Saturation
% See solution above
% 0.15/0.41 # Parsed axioms : 3
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 3
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 3
% 0.15/0.41 # Processed clauses : 20
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 4
% 0.15/0.41 # ...remaining for further processing : 16
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 17
% 0.15/0.41 # ...of the previous two non-redundant : 17
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 17
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 0
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 16
% 0.15/0.41 # Positive orientable unit clauses : 1
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 1
% 0.15/0.41 # Non-unit-clauses : 14
% 0.15/0.41 # Current number of unprocessed clauses: 0
% 0.15/0.41 # ...number of literals in the above : 0
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 0
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 153
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 147
% 0.15/0.41 # Non-unit clause-clause subsumptions : 4
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 0
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 888
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.001 s
% 0.15/0.41 # System time : 0.003 s
% 0.15/0.41 # Total time : 0.004 s
% 0.15/0.41 # Maximum resident set size: 1640 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.001 s
% 0.15/0.41 # System time : 0.005 s
% 0.15/0.41 # Total time : 0.007 s
% 0.15/0.41 # Maximum resident set size: 1676 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------