TSTP Solution File: LCL130-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n015.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 : 600s
% DateTime : Sun Jul 17 12:07:04 EDT 2022
% Result : Unsatisfiable 1.81s 0.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 04:45:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.81/0.58 % SZS status Unsatisfiable
% 1.81/0.58 % SZS output begin IncompleteProof
% 1.81/0.58 cnf(c0, axiom,
% 1.81/0.58 ~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))).
% 1.81/0.58 cnf(c1, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
% 1.81/0.58 inference(start, [], [c0])).
% 1.81/0.58
% 1.81/0.58 cnf(c2, axiom,
% 1.81/0.58 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0))).
% 1.81/0.58 cnf(a0, assumption,
% 1.81/0.58 equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))) = X0).
% 1.81/0.58 cnf(c3, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 1.81/0.58 cnf(c4, plain,
% 1.81/0.58 ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 1.81/0.58
% 1.81/0.58 cnf(c5, axiom,
% 1.81/0.58 is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(equivalent(X3,X2))).
% 1.81/0.58 cnf(a1, assumption,
% 1.81/0.58 X1 = X2).
% 1.81/0.58 cnf(c6, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(X1,X0)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 1.81/0.58 cnf(c7, plain,
% 1.81/0.58 ~is_a_theorem(X3) | ~is_a_theorem(equivalent(X3,X2)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 1.81/0.58
% 1.81/0.58 cnf(c8, axiom,
% 1.81/0.58 is_a_theorem(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4))).
% 1.81/0.58 cnf(a2, assumption,
% 1.81/0.58 X3 = equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4)).
% 1.81/0.58 cnf(c9, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(X3,X2)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 1.81/0.58 cnf(c10, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 1.81/0.58
% 1.81/0.58 cnf(c11, axiom,
% 1.81/0.58 is_a_theorem(X8) | ~is_a_theorem(X9) | ~is_a_theorem(equivalent(X9,X8))).
% 1.81/0.58 cnf(a3, assumption,
% 1.81/0.58 equivalent(X3,X2) = X8).
% 1.81/0.58 cnf(c12, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 1.81/0.58 cnf(c13, plain,
% 1.81/0.58 ~is_a_theorem(X9) | ~is_a_theorem(equivalent(X9,X8)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 1.81/0.58
% 1.81/0.58 cnf(c14, plain,
% 1.81/0.58 is_a_theorem(X3)).
% 1.81/0.58 cnf(a4, assumption,
% 1.81/0.58 X9 = X3).
% 1.81/0.58 cnf(c15, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(X9,X8)),
% 1.81/0.58 inference(predicate_reduction, [assumptions([a4])], [c13, c14])).
% 1.81/0.58
% 1.81/0.58 cnf(c16, axiom,
% 1.81/0.58 is_a_theorem(X10) | ~is_a_theorem(X11) | ~is_a_theorem(equivalent(X11,X10))).
% 1.81/0.58 cnf(a5, assumption,
% 1.81/0.58 equivalent(X9,X8) = X10).
% 1.81/0.58 cnf(c17, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])).
% 1.81/0.58 cnf(c18, plain,
% 1.81/0.58 ~is_a_theorem(X11) | ~is_a_theorem(equivalent(X11,X10)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])).
% 1.81/0.58
% 1.81/0.58 cnf(c19, axiom,
% 1.81/0.58 is_a_theorem(X12) | ~is_a_theorem(X13) | ~is_a_theorem(equivalent(X13,X12))).
% 1.81/0.58 cnf(a6, assumption,
% 1.81/0.58 X11 = X12).
% 1.81/0.58 cnf(c20, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(X11,X10)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])).
% 1.81/0.58 cnf(c21, plain,
% 1.81/0.58 ~is_a_theorem(X13) | ~is_a_theorem(equivalent(X13,X12)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])).
% 1.81/0.58
% 1.81/0.58 cnf(c22, axiom,
% 1.81/0.58 is_a_theorem(X14) | ~is_a_theorem(X15) | ~is_a_theorem(equivalent(X15,X14))).
% 1.81/0.58 cnf(a7, assumption,
% 1.81/0.58 X13 = X14).
% 1.81/0.58 cnf(c23, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(X13,X12)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])).
% 1.81/0.58 cnf(c24, plain,
% 1.81/0.58 ~is_a_theorem(X15) | ~is_a_theorem(equivalent(X15,X14)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])).
% 1.81/0.58
% 1.81/0.58 cnf(c25, axiom,
% 1.81/0.58 is_a_theorem(equivalent(equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19)))),X16))).
% 1.81/0.58 cnf(a8, assumption,
% 1.81/0.58 X15 = equivalent(equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19)))),X16)).
% 1.81/0.58 cnf(c26, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(X15,X14)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a8])], [c24, c25])).
% 1.81/0.58 cnf(c27, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a8])], [c24, c25])).
% 1.81/0.58
% 1.81/0.58 cnf(c28, axiom,
% 1.81/0.58 is_a_theorem(equivalent(equivalent(X20,equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))),X20))).
% 1.81/0.58 cnf(a9, assumption,
% 1.81/0.58 equivalent(X15,X14) = equivalent(equivalent(X20,equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))),X20)).
% 1.81/0.58 cnf(c29, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a9])], [c26, c28])).
% 1.81/0.58 cnf(c30, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a9])], [c26, c28])).
% 1.81/0.58
% 1.81/0.58 cnf(c31, plain,
% 1.81/0.58 is_a_theorem(X15)).
% 1.81/0.58 cnf(a10, assumption,
% 1.81/0.58 equivalent(X13,X12) = X15).
% 1.81/0.58 cnf(c32, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(predicate_reduction, [assumptions([a10])], [c23, c31])).
% 1.81/0.58
% 1.81/0.58 cnf(c33, plain,
% 1.81/0.58 is_a_theorem(X13)).
% 1.81/0.58 cnf(a11, assumption,
% 1.81/0.58 equivalent(X11,X10) = X13).
% 1.81/0.58 cnf(c34, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(predicate_reduction, [assumptions([a11])], [c20, c33])).
% 1.81/0.58
% 1.81/0.58 cnf(c35, axiom,
% 1.81/0.58 is_a_theorem(X24) | ~is_a_theorem(X25) | ~is_a_theorem(equivalent(X25,X24))).
% 1.81/0.58 cnf(a12, assumption,
% 1.81/0.58 equivalent(X1,X0) = X24).
% 1.81/0.58 cnf(c36, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a12])], [c6, c35])).
% 1.81/0.58 cnf(c37, plain,
% 1.81/0.58 ~is_a_theorem(X25) | ~is_a_theorem(equivalent(X25,X24)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a12])], [c6, c35])).
% 1.81/0.58
% 1.81/0.58 cnf(c38, axiom,
% 1.81/0.58 is_a_theorem(equivalent(equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29)))),X26))).
% 1.81/0.58 cnf(a13, assumption,
% 1.81/0.58 X25 = equivalent(equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29)))),X26)).
% 1.81/0.58 cnf(c39, plain,
% 1.81/0.58 ~is_a_theorem(equivalent(X25,X24)),
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a13])], [c37, c38])).
% 1.81/0.58 cnf(c40, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(strict_predicate_extension, [assumptions([a13])], [c37, c38])).
% 1.81/0.58
% 1.81/0.58 cnf(c41, plain,
% 1.81/0.58 is_a_theorem(X11)).
% 1.81/0.58 cnf(a14, assumption,
% 1.81/0.58 equivalent(X25,X24) = X11).
% 1.81/0.58 cnf(c42, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(predicate_reduction, [assumptions([a14])], [c39, c41])).
% 1.81/0.58
% 1.81/0.58 cnf(c43, plain,
% 1.81/0.58 $false,
% 1.81/0.58 inference(constraint_solving, [
% 1.81/0.58 bind(X0, equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
% 1.81/0.58 bind(X1, equivalent(X18,X19)),
% 1.81/0.58 bind(X2, equivalent(X18,X19)),
% 1.81/0.58 bind(X3, equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4)),
% 1.81/0.58 bind(X4, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))),
% 1.81/0.58 bind(X5, X5),
% 1.81/0.58 bind(X6, X6),
% 1.81/0.58 bind(X7, X7),
% 1.81/0.58 bind(X8, equivalent(X3,X2)),
% 1.81/0.58 bind(X9, equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4)),
% 1.81/0.58 bind(X10, equivalent(X9,X8)),
% 1.81/0.58 bind(X11, equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))),
% 1.81/0.58 bind(X12, equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))),
% 1.81/0.58 bind(X13, equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19))))),
% 1.81/0.58 bind(X14, equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19))))),
% 1.81/0.58 bind(X15, equivalent(equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19)))),X16)),
% 1.81/0.58 bind(X16, equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))),
% 1.81/0.58 bind(X17, equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7))))),
% 1.81/0.58 bind(X18, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))),
% 1.81/0.58 bind(X19, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))),
% 1.81/0.58 bind(X20, equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19))))),
% 1.81/0.58 bind(X21, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))),
% 1.81/0.58 bind(X22, a),
% 1.81/0.58 bind(X23, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))),
% 1.81/0.58 bind(X24, equivalent(X1,X0)),
% 1.81/0.58 bind(X25, equivalent(equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29)))),X26)),
% 1.81/0.58 bind(X26, a),
% 1.81/0.58 bind(X27, b),
% 1.81/0.58 bind(X28, c),
% 1.81/0.58 bind(X29, e)
% 1.81/0.58 ],
% 1.81/0.58 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 1.81/0.58
% 1.81/0.58 % SZS output end IncompleteProof
%------------------------------------------------------------------------------