TSTP Solution File: LCL117-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL117-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 : n008.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:00 EDT 2022
% Result : Unsatisfiable 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL117-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n008.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 23:30:08 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(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),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(equivalent(a,b),equivalent(a,c)),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(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X5),equivalent(X6,X4))))).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X3 = equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X5),equivalent(X6,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 $false,
% 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(X7) | ~is_a_theorem(X8) | ~is_a_theorem(equivalent(X8,X7))).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 equivalent(X3,X2) = X7).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 ~is_a_theorem(X8) | ~is_a_theorem(equivalent(X8,X7)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, plain,
% 0.13/0.35 is_a_theorem(X3)).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X8 = X3).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(X8,X7)),
% 0.13/0.35 inference(predicate_reduction, [assumptions([a4])], [c13, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c16, axiom,
% 0.13/0.35 is_a_theorem(equivalent(equivalent(X9,X10),equivalent(equivalent(X11,X10),equivalent(X11,X9))))).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 equivalent(X8,X7) = equivalent(equivalent(X9,X10),equivalent(equivalent(X11,X10),equivalent(X11,X9)))).
% 0.13/0.35 cnf(c17, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])).
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])).
% 0.13/0.35
% 0.13/0.35 cnf(c19, axiom,
% 0.13/0.35 is_a_theorem(X12) | ~is_a_theorem(X13) | ~is_a_theorem(equivalent(X13,X12))).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 equivalent(X1,X0) = X12).
% 0.13/0.35 cnf(c20, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c6, c19])).
% 0.13/0.35 cnf(c21, plain,
% 0.13/0.35 ~is_a_theorem(X13) | ~is_a_theorem(equivalent(X13,X12)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c6, c19])).
% 0.13/0.35
% 0.13/0.35 cnf(c22, axiom,
% 0.13/0.35 is_a_theorem(equivalent(equivalent(X14,X15),equivalent(equivalent(X16,X15),equivalent(X16,X14))))).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 X13 = equivalent(equivalent(X14,X15),equivalent(equivalent(X16,X15),equivalent(X16,X14)))).
% 0.13/0.35 cnf(c23, plain,
% 0.13/0.35 ~is_a_theorem(equivalent(X13,X12)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])).
% 0.13/0.35 cnf(c24, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])).
% 0.13/0.35
% 0.13/0.35 cnf(c25, axiom,
% 0.13/0.35 is_a_theorem(equivalent(equivalent(X17,X18),equivalent(equivalent(X19,X18),equivalent(X19,X17))))).
% 0.13/0.35 cnf(a8, assumption,
% 0.13/0.35 equivalent(X13,X12) = equivalent(equivalent(X17,X18),equivalent(equivalent(X19,X18),equivalent(X19,X17)))).
% 0.13/0.35 cnf(c26, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c23, c25])).
% 0.13/0.35 cnf(c27, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c23, c25])).
% 0.13/0.35
% 0.13/0.35 cnf(c28, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
% 0.13/0.35 bind(X1, equivalent(X11,X9)),
% 0.13/0.35 bind(X2, equivalent(X11,X9)),
% 0.13/0.35 bind(X3, equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X5),equivalent(X6,X4)))),
% 0.13/0.35 bind(X4, equivalent(X16,X15)),
% 0.13/0.35 bind(X5, equivalent(X16,X14)),
% 0.13/0.35 bind(X6, X6),
% 0.13/0.35 bind(X7, equivalent(X3,X2)),
% 0.13/0.35 bind(X8, equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X5),equivalent(X6,X4)))),
% 0.13/0.35 bind(X9, equivalent(X4,X5)),
% 0.13/0.35 bind(X10, equivalent(equivalent(X6,X5),equivalent(X6,X4))),
% 0.13/0.35 bind(X11, equivalent(X4,X5)),
% 0.13/0.35 bind(X12, equivalent(X1,X0)),
% 0.13/0.35 bind(X13, equivalent(equivalent(X14,X15),equivalent(equivalent(X16,X15),equivalent(X16,X14)))),
% 0.13/0.35 bind(X14, c),
% 0.13/0.35 bind(X15, b),
% 0.13/0.35 bind(X16, a),
% 0.13/0.35 bind(X17, equivalent(X14,X15)),
% 0.13/0.35 bind(X18, equivalent(equivalent(X16,X15),equivalent(X16,X14))),
% 0.13/0.35 bind(X19, equivalent(X4,X5))
% 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
%------------------------------------------------------------------------------