TSTP Solution File: LCL126-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL126-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:02 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL126-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.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 01:37:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 ~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c)))).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 ~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0))).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c)) = X0).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4))))).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X1 = equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 ~is_a_theorem(equivalent(X1,X0)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 is_a_theorem(X5) | ~is_a_theorem(X6) | ~is_a_theorem(equivalent(X6,X5))).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 equivalent(X1,X0) = X5).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 ~is_a_theorem(X6) | ~is_a_theorem(equivalent(X6,X5)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c11, axiom,
% 0.12/0.34 is_a_theorem(equivalent(equivalent(X7,X8),equivalent(equivalent(X7,X9),equivalent(X8,X9))))).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 X6 = equivalent(equivalent(X7,X8),equivalent(equivalent(X7,X9),equivalent(X8,X9)))).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 ~is_a_theorem(equivalent(X6,X5)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.12/0.34
% 0.12/0.34 cnf(c14, axiom,
% 0.12/0.34 is_a_theorem(X10) | ~is_a_theorem(X11) | ~is_a_theorem(equivalent(X11,X10))).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 equivalent(X6,X5) = X10).
% 0.12/0.34 cnf(c15, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.12/0.34 cnf(c16, plain,
% 0.12/0.34 ~is_a_theorem(X11) | ~is_a_theorem(equivalent(X11,X10)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.12/0.34
% 0.12/0.34 cnf(c17, axiom,
% 0.12/0.34 is_a_theorem(equivalent(X12,equivalent(equivalent(X12,equivalent(X13,X14)),equivalent(X14,X13))))).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 X11 = equivalent(X12,equivalent(equivalent(X12,equivalent(X13,X14)),equivalent(X14,X13)))).
% 0.12/0.34 cnf(c18, plain,
% 0.12/0.34 ~is_a_theorem(equivalent(X11,X10)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.12/0.34 cnf(c19, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.12/0.34
% 0.12/0.34 cnf(c20, axiom,
% 0.12/0.34 is_a_theorem(X15) | ~is_a_theorem(X16) | ~is_a_theorem(equivalent(X16,X15))).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 equivalent(X11,X10) = X15).
% 0.12/0.34 cnf(c21, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 0.12/0.34 cnf(c22, plain,
% 0.12/0.34 ~is_a_theorem(X16) | ~is_a_theorem(equivalent(X16,X15)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 0.12/0.34
% 0.12/0.34 cnf(c23, plain,
% 0.12/0.34 is_a_theorem(X1)).
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 X16 = X1).
% 0.12/0.34 cnf(c24, plain,
% 0.12/0.34 ~is_a_theorem(equivalent(X16,X15)),
% 0.12/0.34 inference(predicate_reduction, [assumptions([a7])], [c22, c23])).
% 0.12/0.34
% 0.12/0.34 cnf(c25, axiom,
% 0.12/0.34 is_a_theorem(equivalent(X17,equivalent(equivalent(X17,equivalent(X18,X19)),equivalent(X19,X18))))).
% 0.12/0.34 cnf(a8, assumption,
% 0.12/0.34 equivalent(X16,X15) = equivalent(X17,equivalent(equivalent(X17,equivalent(X18,X19)),equivalent(X19,X18)))).
% 0.12/0.34 cnf(c26, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c24, c25])).
% 0.12/0.34 cnf(c27, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c24, c25])).
% 0.12/0.34
% 0.12/0.34 cnf(c28, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
% 0.12/0.34 bind(X1, equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))),
% 0.12/0.34 bind(X2, X2),
% 0.12/0.34 bind(X3, X3),
% 0.12/0.34 bind(X4, X4),
% 0.12/0.34 bind(X5, equivalent(X1,X0)),
% 0.12/0.34 bind(X6, equivalent(equivalent(X7,X8),equivalent(equivalent(X7,X9),equivalent(X8,X9)))),
% 0.12/0.34 bind(X7, a),
% 0.12/0.34 bind(X8, c),
% 0.12/0.34 bind(X9, b),
% 0.12/0.34 bind(X10, equivalent(X6,X5)),
% 0.12/0.34 bind(X11, equivalent(X12,equivalent(equivalent(X12,equivalent(X13,X14)),equivalent(X14,X13)))),
% 0.12/0.34 bind(X12, equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))),
% 0.12/0.34 bind(X13, equivalent(equivalent(X7,X9),equivalent(X8,X9))),
% 0.12/0.34 bind(X14, equivalent(X7,X8)),
% 0.12/0.34 bind(X15, equivalent(X11,X10)),
% 0.12/0.34 bind(X16, equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))),
% 0.12/0.34 bind(X17, equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))),
% 0.12/0.34 bind(X18, equivalent(X12,equivalent(X13,X14))),
% 0.12/0.34 bind(X19, equivalent(X14,X13))
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------