TSTP Solution File: LCL106-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL106-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 : n029.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:06:52 EDT 2022
% Result : Unsatisfiable 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL106-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 06:35:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Unsatisfiable
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 ~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b))))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0))).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b))) = X0).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(equivalent(X3,X2))).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 X1 = X2).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(X1,X0)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 ~is_a_theorem(X3) | ~is_a_theorem(equivalent(X3,X2)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 is_a_theorem(X4) | ~is_a_theorem(X5) | ~is_a_theorem(equivalent(X5,X4))).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X3 = X4).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(X3,X2)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 ~is_a_theorem(X5) | ~is_a_theorem(equivalent(X5,X4)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 is_a_theorem(equivalent(equivalent(equivalent(X6,X7),equivalent(X6,X8)),equivalent(X7,X8)))).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X5 = equivalent(equivalent(equivalent(X6,X7),equivalent(X6,X8)),equivalent(X7,X8))).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(X5,X4)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, axiom,
% 0.13/0.35 is_a_theorem(X9) | ~is_a_theorem(X10) | ~is_a_theorem(equivalent(X10,X9))).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 equivalent(X5,X4) = X9).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 ~is_a_theorem(X10) | ~is_a_theorem(equivalent(X10,X9)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c17, axiom,
% 0.13/0.35 is_a_theorem(equivalent(X11,equivalent(equivalent(X12,X13),equivalent(equivalent(X13,X12),X11))))).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X10 = equivalent(X11,equivalent(equivalent(X12,X13),equivalent(equivalent(X13,X12),X11)))).
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(X10,X9)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.13/0.35 cnf(c19, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.13/0.35
% 0.13/0.35 cnf(c20, axiom,
% 0.13/0.35 is_a_theorem(equivalent(X14,equivalent(equivalent(X15,X16),equivalent(equivalent(X16,X15),X14))))).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 equivalent(X10,X9) = equivalent(X14,equivalent(equivalent(X15,X16),equivalent(equivalent(X16,X15),X14)))).
% 0.13/0.35 cnf(c21, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 0.13/0.35 cnf(c22, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 0.13/0.35
% 0.13/0.35 cnf(c23, axiom,
% 0.13/0.35 is_a_theorem(equivalent(equivalent(equivalent(X17,X18),equivalent(X17,X19)),equivalent(X18,X19)))).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 equivalent(X3,X2) = equivalent(equivalent(equivalent(X17,X18),equivalent(X17,X19)),equivalent(X18,X19))).
% 0.13/0.35 cnf(c24, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c9, c23])).
% 0.13/0.35 cnf(c25, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c9, c23])).
% 0.13/0.35
% 0.13/0.35 cnf(c26, axiom,
% 0.13/0.35 is_a_theorem(equivalent(equivalent(equivalent(X20,X21),equivalent(X20,X22)),equivalent(X21,X22)))).
% 0.13/0.35 cnf(a8, assumption,
% 0.13/0.35 equivalent(X1,X0) = equivalent(equivalent(equivalent(X20,X21),equivalent(X20,X22)),equivalent(X21,X22))).
% 0.13/0.35 cnf(c27, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c6, c26])).
% 0.13/0.35 cnf(c28, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c6, c26])).
% 0.13/0.35
% 0.13/0.35 cnf(c29, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
% 0.13/0.35 bind(X1, equivalent(X18,X19)),
% 0.13/0.35 bind(X2, equivalent(X18,X19)),
% 0.13/0.35 bind(X3, equivalent(equivalent(X16,X15),X14)),
% 0.13/0.35 bind(X4, equivalent(equivalent(X16,X15),X14)),
% 0.13/0.35 bind(X5, equivalent(equivalent(equivalent(X6,X7),equivalent(X6,X8)),equivalent(X7,X8))),
% 0.13/0.35 bind(X6, a),
% 0.13/0.35 bind(X7, c),
% 0.13/0.35 bind(X8, b),
% 0.13/0.35 bind(X9, equivalent(X5,X4)),
% 0.13/0.35 bind(X10, equivalent(X11,equivalent(equivalent(X12,X13),equivalent(equivalent(X13,X12),X11)))),
% 0.13/0.35 bind(X11, equivalent(X7,X8)),
% 0.13/0.35 bind(X12, a),
% 0.13/0.35 bind(X13, c),
% 0.13/0.35 bind(X14, equivalent(X11,equivalent(equivalent(X12,X13),equivalent(equivalent(X13,X12),X11)))),
% 0.13/0.35 bind(X15, equivalent(equivalent(X6,X7),equivalent(X6,X8))),
% 0.13/0.35 bind(X16, equivalent(X7,X8)),
% 0.13/0.35 bind(X17, equivalent(X7,X8)),
% 0.13/0.35 bind(X18, equivalent(equivalent(X6,X7),equivalent(X6,X8))),
% 0.13/0.35 bind(X19, equivalent(equivalent(X12,X13),equivalent(equivalent(X13,X12),X11))),
% 0.13/0.35 bind(X20, equivalent(X6,X7)),
% 0.13/0.35 bind(X21, equivalent(X6,X8)),
% 0.13/0.35 bind(X22, equivalent(equivalent(X13,X12),X11))
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------