TSTP Solution File: LCL089-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL089-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:23:42 EDT 2023
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 3
% Syntax : Number of clauses : 41 ( 25 unt; 0 nHn; 8 RR)
% Number of literals : 59 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 128 ( 57 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6kxCBYsyMG/E---3.1_30134.p',condensed_detachment) ).
cnf(ic_JLukasiewicz_4,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(X5,implies(implies(X4,X1),implies(X3,X1))))),
file('/export/starexec/sandbox2/tmp/tmp.6kxCBYsyMG/E---3.1_30134.p',ic_JLukasiewicz_4) ).
cnf(prove_ic_4,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox2/tmp/tmp.6kxCBYsyMG/E---3.1_30134.p',prove_ic_4) ).
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(X5,implies(implies(X4,X1),implies(X3,X1))))),
ic_JLukasiewicz_4 ).
cnf(c_0_5,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(implies(X3,X5),implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),implies(X4,X3)),implies(X3,X5)),implies(X6,implies(X3,X5))))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))
| ~ is_a_theorem(X6) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(implies(X4,X2),implies(X5,X2)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_18]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_4]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X2,X3)),implies(X4,implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_5,c_0_21]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_23,c_0_4]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_24]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_26]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X4),implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_27,c_0_4]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_28]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X2,X3)),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_30,c_0_4]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_33]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_34]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,X2),implies(X3,implies(implies(X2,X4),implies(X1,X4))))),
inference(spm,[status(thm)],[c_0_35,c_0_4]) ).
cnf(c_0_38,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
prove_ic_4 ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : LCL089-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n011.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 13:04:53 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.6kxCBYsyMG/E---3.1_30134.p
% 0.18/0.49 # Version: 3.1pre001
% 0.18/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # new_bool_1 with pid 30213 completed with status 0
% 0.18/0.49 # Result found by new_bool_1
% 0.18/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 0.18/0.49 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 30218 completed with status 0
% 0.18/0.49 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.18/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 0.18/0.49 # Preprocessing time : 0.001 s
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Unsatisfiable
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 3
% 0.18/0.49 # Removed by relevancy pruning/SinE : 0
% 0.18/0.49 # Initial clauses : 3
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 3
% 0.18/0.49 # Processed clauses : 310
% 0.18/0.49 # ...of these trivial : 16
% 0.18/0.49 # ...subsumed : 183
% 0.18/0.49 # ...remaining for further processing : 111
% 0.18/0.49 # Other redundant clauses eliminated : 0
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 2
% 0.18/0.49 # Backward-rewritten : 20
% 0.18/0.49 # Generated clauses : 1732
% 0.18/0.49 # ...of the previous two non-redundant : 1195
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 0
% 0.18/0.49 # Paramodulations : 1732
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 0
% 0.18/0.49 # Total rewrite steps : 540
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 89
% 0.18/0.49 # Positive orientable unit clauses : 46
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 4
% 0.18/0.49 # Non-unit-clauses : 39
% 0.18/0.49 # Current number of unprocessed clauses: 674
% 0.18/0.49 # ...number of literals in the above : 808
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 22
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 1539
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 1539
% 0.18/0.49 # Non-unit clause-clause subsumptions : 181
% 0.18/0.49 # Unit Clause-clause subsumption calls : 230
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 1241
% 0.18/0.49 # BW rewrite match successes : 20
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 17340
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.015 s
% 0.18/0.49 # System time : 0.001 s
% 0.18/0.49 # Total time : 0.016 s
% 0.18/0.49 # Maximum resident set size: 1640 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.016 s
% 0.18/0.49 # System time : 0.003 s
% 0.18/0.49 # Total time : 0.019 s
% 0.18/0.49 # Maximum resident set size: 1676 pages
% 0.18/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------