TSTP Solution File: LCL043-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL043-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 : n023.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.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL043-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n023.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 : Tue Jul 5 00:19:42 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(implies(not(not(a)),a))).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 ~is_a_theorem(implies(not(not(a)),a)),
% 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(implies(X1,X0))).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 implies(not(not(a)),a) = 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(implies(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(implies(X2,implies(not(X2),X3)))).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X1 = implies(X2,implies(not(X2),X3))).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 ~is_a_theorem(implies(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(X4) | ~is_a_theorem(X5) | ~is_a_theorem(implies(X5,X4))).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 implies(X1,X0) = X4).
% 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(X5) | ~is_a_theorem(implies(X5,X4)),
% 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(implies(X6,implies(X7,X6)))).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 X5 = implies(X6,implies(X7,X6))).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 ~is_a_theorem(implies(X5,X4)),
% 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(implies(implies(X8,X9),implies(implies(not(X8),X9),X9)))).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 implies(X5,X4) = implies(implies(X8,X9),implies(implies(not(X8),X9),X9))).
% 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 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.12/0.34
% 0.12/0.34 cnf(c17, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, implies(not(not(a)),a)),
% 0.12/0.34 bind(X1, implies(X2,implies(not(X2),X3))),
% 0.12/0.34 bind(X2, not(X8)),
% 0.12/0.34 bind(X3, a),
% 0.12/0.34 bind(X4, implies(X1,X0)),
% 0.12/0.34 bind(X5, implies(X6,implies(X7,X6))),
% 0.12/0.34 bind(X6, a),
% 0.12/0.34 bind(X7, not(X2)),
% 0.12/0.34 bind(X8, a),
% 0.12/0.34 bind(X9, implies(X7,X6))
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------