TSTP Solution File: LCL046-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL046-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:06:32 EDT 2022
% Result : Unsatisfiable 0.13s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL046-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 14:16:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % SZS status Unsatisfiable
% 0.13/0.34 % SZS output begin IncompleteProof
% 0.13/0.34 cnf(c0, axiom,
% 0.13/0.34 ~is_a_theorem(implies(a,a))).
% 0.13/0.34 cnf(c1, plain,
% 0.13/0.34 ~is_a_theorem(implies(a,a)),
% 0.13/0.34 inference(start, [], [c0])).
% 0.13/0.34
% 0.13/0.34 cnf(c2, axiom,
% 0.13/0.34 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 0.13/0.34 cnf(a0, assumption,
% 0.13/0.34 implies(a,a) = X0).
% 0.13/0.34 cnf(c3, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.34 cnf(c4, plain,
% 0.13/0.34 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.34
% 0.13/0.34 cnf(c5, axiom,
% 0.13/0.34 is_a_theorem(implies(implies(not(X2),X2),X2))).
% 0.13/0.34 cnf(a1, assumption,
% 0.13/0.34 X1 = implies(implies(not(X2),X2),X2)).
% 0.13/0.34 cnf(c6, plain,
% 0.13/0.34 ~is_a_theorem(implies(X1,X0)),
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.34 cnf(c7, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.34
% 0.13/0.34 cnf(c8, axiom,
% 0.13/0.34 is_a_theorem(X3) | ~is_a_theorem(X4) | ~is_a_theorem(implies(X4,X3))).
% 0.13/0.34 cnf(a2, assumption,
% 0.13/0.34 implies(X1,X0) = X3).
% 0.13/0.34 cnf(c9, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.34 cnf(c10, plain,
% 0.13/0.34 ~is_a_theorem(X4) | ~is_a_theorem(implies(X4,X3)),
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.34
% 0.13/0.34 cnf(c11, axiom,
% 0.13/0.34 is_a_theorem(implies(X5,implies(not(X5),X6)))).
% 0.13/0.34 cnf(a3, assumption,
% 0.13/0.34 X4 = implies(X5,implies(not(X5),X6))).
% 0.13/0.34 cnf(c12, plain,
% 0.13/0.34 ~is_a_theorem(implies(X4,X3)),
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.34 cnf(c13, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.34
% 0.13/0.34 cnf(c14, axiom,
% 0.13/0.34 is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))).
% 0.13/0.34 cnf(a4, assumption,
% 0.13/0.34 implies(X4,X3) = implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))).
% 0.13/0.34 cnf(c15, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.13/0.34 cnf(c16, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.13/0.34
% 0.13/0.34 cnf(c17, plain,
% 0.13/0.34 $false,
% 0.13/0.34 inference(constraint_solving, [
% 0.13/0.34 bind(X0, implies(a,a)),
% 0.13/0.34 bind(X1, implies(implies(not(X2),X2),X2)),
% 0.13/0.34 bind(X2, a),
% 0.13/0.34 bind(X3, implies(X1,X0)),
% 0.13/0.34 bind(X4, implies(X5,implies(not(X5),X6))),
% 0.13/0.34 bind(X5, a),
% 0.13/0.34 bind(X6, a),
% 0.13/0.34 bind(X7, a),
% 0.13/0.34 bind(X8, implies(not(X5),X6)),
% 0.13/0.34 bind(X9, a)
% 0.13/0.34 ],
% 0.13/0.34 [a0, a1, a2, a3, a4])).
% 0.13/0.34
% 0.13/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------