TSTP Solution File: LCL398-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL398-1 : TPTP v8.1.0. Released v2.3.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:08:52 EDT 2022
% Result : Unsatisfiable 0.14s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% 0.13/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jul 2 23:13:08 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % SZS status Unsatisfiable
% 0.14/0.37 % SZS output begin IncompleteProof
% 0.14/0.37 cnf(c0, axiom,
% 0.14/0.37 ~is_a_theorem(implies(not(implies(x,x)),y))).
% 0.14/0.37 cnf(c1, plain,
% 0.14/0.37 ~is_a_theorem(implies(not(implies(x,x)),y)),
% 0.14/0.37 inference(start, [], [c0])).
% 0.14/0.37
% 0.14/0.37 cnf(c2, axiom,
% 0.14/0.37 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 0.14/0.37 cnf(a0, assumption,
% 0.14/0.37 implies(not(implies(x,x)),y) = X0).
% 0.14/0.37 cnf(c3, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.37 cnf(c4, plain,
% 0.14/0.37 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.37
% 0.14/0.37 cnf(c5, axiom,
% 0.14/0.37 is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2))).
% 0.14/0.37 cnf(a1, assumption,
% 0.14/0.37 X1 = X2).
% 0.14/0.37 cnf(c6, plain,
% 0.14/0.37 ~is_a_theorem(implies(X1,X0)),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.14/0.37 cnf(c7, plain,
% 0.14/0.37 ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2)),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.14/0.37
% 0.14/0.37 cnf(c8, axiom,
% 0.14/0.37 is_a_theorem(implies(implies(not(X4),X4),X4))).
% 0.14/0.37 cnf(a2, assumption,
% 0.14/0.37 X3 = implies(implies(not(X4),X4),X4)).
% 0.14/0.37 cnf(c9, plain,
% 0.14/0.37 ~is_a_theorem(implies(X3,X2)),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.14/0.37 cnf(c10, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.14/0.37
% 0.14/0.37 cnf(c11, axiom,
% 0.14/0.37 is_a_theorem(X5) | ~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5))).
% 0.14/0.37 cnf(a3, assumption,
% 0.14/0.37 implies(X3,X2) = X5).
% 0.14/0.37 cnf(c12, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 0.14/0.37 cnf(c13, plain,
% 0.14/0.37 ~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5)),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 0.14/0.37
% 0.14/0.37 cnf(c14, axiom,
% 0.14/0.37 is_a_theorem(implies(X7,implies(not(X7),X8)))).
% 0.14/0.37 cnf(a4, assumption,
% 0.14/0.37 X6 = implies(X7,implies(not(X7),X8))).
% 0.14/0.37 cnf(c15, plain,
% 0.14/0.37 ~is_a_theorem(implies(X6,X5)),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.14/0.37 cnf(c16, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.14/0.37
% 0.14/0.37 cnf(c17, axiom,
% 0.14/0.37 is_a_theorem(implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11))))).
% 0.14/0.37 cnf(a5, assumption,
% 0.14/0.37 implies(X6,X5) = implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11)))).
% 0.14/0.37 cnf(c18, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.14/0.37 cnf(c19, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.14/0.37
% 0.14/0.37 cnf(c20, axiom,
% 0.14/0.37 is_a_theorem(implies(X12,implies(not(X12),X13)))).
% 0.14/0.37 cnf(a6, assumption,
% 0.14/0.37 implies(X1,X0) = implies(X12,implies(not(X12),X13))).
% 0.14/0.37 cnf(c21, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c6, c20])).
% 0.14/0.37 cnf(c22, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c6, c20])).
% 0.14/0.37
% 0.14/0.37 cnf(c23, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(constraint_solving, [
% 0.14/0.37 bind(X0, implies(not(implies(x,x)),y)),
% 0.14/0.37 bind(X1, implies(X9,X11)),
% 0.14/0.37 bind(X2, implies(X9,X11)),
% 0.14/0.37 bind(X3, implies(implies(not(X4),X4),X4)),
% 0.14/0.37 bind(X4, x),
% 0.14/0.37 bind(X5, implies(X3,X2)),
% 0.14/0.37 bind(X6, implies(X7,implies(not(X7),X8))),
% 0.14/0.37 bind(X7, x),
% 0.14/0.37 bind(X8, x),
% 0.14/0.37 bind(X9, x),
% 0.14/0.37 bind(X10, implies(not(X7),X8)),
% 0.14/0.37 bind(X11, x),
% 0.14/0.37 bind(X12, implies(X9,X11)),
% 0.14/0.37 bind(X13, y)
% 0.14/0.37 ],
% 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6])).
% 0.14/0.37
% 0.14/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------