TSTP Solution File: LCL095-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL095-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:11:31 EDT 2023
% Result : Unsatisfiable 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 3
% Syntax : Number of clauses : 57 ( 36 unt; 0 nHn; 6 RR)
% Number of literals : 80 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 243 ( 149 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.vJjdfBpgpl/E---3.1_5206.p',condensed_detachment) ).
cnf(ic_JLukasiewicz_5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(implies(X4,X1),implies(X5,implies(X3,X1))))),
file('/export/starexec/sandbox/tmp/tmp.vJjdfBpgpl/E---3.1_5206.p',ic_JLukasiewicz_5) ).
cnf(prove_ic_5,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
file('/export/starexec/sandbox/tmp/tmp.vJjdfBpgpl/E---3.1_5206.p',prove_ic_5) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(implies(X4,X1),implies(X5,implies(X3,X1))))),
ic_JLukasiewicz_5 ).
cnf(c_0_5,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X4,X2))))
| ~ is_a_theorem(implies(implies(X2,X5),implies(X4,X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X3,X4)),implies(X5,implies(implies(X6,X3),implies(X3,X4))))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X4))))
| ~ is_a_theorem(implies(implies(X5,implies(X6,X3)),implies(X3,X4))) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(implies(X4,X5),implies(X5,X3)))))),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X2,X3)),implies(X4,implies(X5,X2))),implies(X6,implies(X7,implies(X4,implies(X5,X2)))))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,implies(X3,X4))),implies(implies(X5,X4),implies(X4,X6))),implies(X7,implies(X8,implies(implies(X5,X4),implies(X4,X6)))))),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X2,X3)),X4),implies(X5,implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,implies(X2,implies(implies(X3,X4),implies(X4,X5)))))
| ~ is_a_theorem(implies(implies(X6,implies(X7,implies(X8,X4))),implies(implies(X3,X4),implies(X4,X5)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(X4,implies(X5,X3)))))),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X4),implies(X4,implies(X5,X4)))))),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X3),implies(X3,implies(X4,X3)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X3),implies(X3,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_18,c_0_4]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(X5,implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(X3,X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,implies(X4,X1))),implies(X5,implies(X6,implies(X3,implies(X4,X1)))))),
inference(spm,[status(thm)],[c_0_5,c_0_21]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_22,c_0_4]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X5)))))
| ~ is_a_theorem(implies(implies(X5,X6),implies(X3,implies(X4,X5)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X4,implies(X2,implies(X3,X2))))),
inference(spm,[status(thm)],[c_0_5,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,implies(X5,X4)))))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X3)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_28,c_0_4]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_29]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_30,c_0_4]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(X4,implies(X5,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_31]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X2,X3),implies(X4,implies(X5,X3)))))),
inference(spm,[status(thm)],[c_0_32,c_0_4]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_33,c_0_4]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,implies(X4,X2)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_34]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,implies(X4,X1)))),
inference(spm,[status(thm)],[c_0_5,c_0_35]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_36,c_0_4]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(X3,X4),X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_37]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(X5,implies(implies(implies(X4,X6),X3),X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_38]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(implies(implies(X4,X5),X4),X4))))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X3),X3))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_41]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X3),X3)))),
inference(spm,[status(thm)],[c_0_42,c_0_4]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_43]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,implies(X4,X2))),X5),implies(X6,implies(X1,X5)))),
inference(spm,[status(thm)],[c_0_5,c_0_34]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
inference(spm,[status(thm)],[c_0_44,c_0_4]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X3,X4),implies(X3,implies(X5,X4)))))),
inference(spm,[status(thm)],[c_0_39,c_0_45]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_46]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X2,implies(X4,X3)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_47]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_48,c_0_4]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X2,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_49,c_0_4]) ).
cnf(c_0_52,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_50]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(X5,implies(implies(X1,X3),X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
prove_ic_5 ).
cnf(c_0_55,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL095-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 12:04:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.vJjdfBpgpl/E---3.1_5206.p
% 0.16/0.48 # Version: 3.1pre001
% 0.16/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 # Starting sh5l with 300s (1) cores
% 0.16/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5284 completed with status 0
% 0.16/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.48 # No SInE strategy applied
% 0.16/0.48 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.16/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.48 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.16/0.48 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 5295 completed with status 0
% 0.16/0.48 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.48 # No SInE strategy applied
% 0.16/0.48 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.16/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.48 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.48 # Preprocessing time : 0.001 s
% 0.16/0.48 # Presaturation interreduction done
% 0.16/0.48
% 0.16/0.48 # Proof found!
% 0.16/0.48 # SZS status Unsatisfiable
% 0.16/0.48 # SZS output start CNFRefutation
% See solution above
% 0.16/0.48 # Parsed axioms : 3
% 0.16/0.48 # Removed by relevancy pruning/SinE : 0
% 0.16/0.48 # Initial clauses : 3
% 0.16/0.48 # Removed in clause preprocessing : 0
% 0.16/0.48 # Initial clauses in saturation : 3
% 0.16/0.48 # Processed clauses : 271
% 0.16/0.48 # ...of these trivial : 36
% 0.16/0.48 # ...subsumed : 62
% 0.16/0.48 # ...remaining for further processing : 173
% 0.16/0.48 # Other redundant clauses eliminated : 0
% 0.16/0.48 # Clauses deleted for lack of memory : 0
% 0.16/0.48 # Backward-subsumed : 8
% 0.16/0.48 # Backward-rewritten : 73
% 0.16/0.48 # Generated clauses : 2454
% 0.16/0.48 # ...of the previous two non-redundant : 1832
% 0.16/0.48 # ...aggressively subsumed : 0
% 0.16/0.48 # Contextual simplify-reflections : 0
% 0.16/0.48 # Paramodulations : 2454
% 0.16/0.48 # Factorizations : 0
% 0.16/0.48 # NegExts : 0
% 0.16/0.48 # Equation resolutions : 0
% 0.16/0.48 # Total rewrite steps : 738
% 0.16/0.48 # Propositional unsat checks : 0
% 0.16/0.48 # Propositional check models : 0
% 0.16/0.48 # Propositional check unsatisfiable : 0
% 0.16/0.48 # Propositional clauses : 0
% 0.16/0.48 # Propositional clauses after purity: 0
% 0.16/0.48 # Propositional unsat core size : 0
% 0.16/0.48 # Propositional preprocessing time : 0.000
% 0.16/0.48 # Propositional encoding time : 0.000
% 0.16/0.48 # Propositional solver time : 0.000
% 0.16/0.48 # Success case prop preproc time : 0.000
% 0.16/0.48 # Success case prop encoding time : 0.000
% 0.16/0.48 # Success case prop solver time : 0.000
% 0.16/0.48 # Current number of processed clauses : 89
% 0.16/0.48 # Positive orientable unit clauses : 61
% 0.16/0.48 # Positive unorientable unit clauses: 0
% 0.16/0.48 # Negative unit clauses : 3
% 0.16/0.48 # Non-unit-clauses : 25
% 0.16/0.48 # Current number of unprocessed clauses: 570
% 0.16/0.48 # ...number of literals in the above : 819
% 0.16/0.48 # Current number of archived formulas : 0
% 0.16/0.48 # Current number of archived clauses : 84
% 0.16/0.48 # Clause-clause subsumption calls (NU) : 633
% 0.16/0.48 # Rec. Clause-clause subsumption calls : 633
% 0.16/0.48 # Non-unit clause-clause subsumptions : 68
% 0.16/0.48 # Unit Clause-clause subsumption calls : 199
% 0.16/0.48 # Rewrite failures with RHS unbound : 0
% 0.16/0.48 # BW rewrite match attempts : 4151
% 0.16/0.48 # BW rewrite match successes : 73
% 0.16/0.48 # Condensation attempts : 0
% 0.16/0.48 # Condensation successes : 0
% 0.16/0.48 # Termbank termtop insertions : 34343
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.027 s
% 0.16/0.48 # System time : 0.005 s
% 0.16/0.48 # Total time : 0.032 s
% 0.16/0.48 # Maximum resident set size: 1576 pages
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.150 s
% 0.16/0.48 # System time : 0.011 s
% 0.16/0.48 # Total time : 0.161 s
% 0.16/0.48 # Maximum resident set size: 1672 pages
% 0.16/0.48 % E---3.1 exiting
% 0.16/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------