TSTP Solution File: LCL452+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL452+1 : TPTP v8.1.0. Released v3.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 : n004.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:09:17 EDT 2022
% Result : Theorem 0.12s 0.41s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL452+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 23:34:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.41 % SZS status Theorem
% 0.12/0.41 % SZS output begin IncompleteProof
% 0.12/0.41 cnf(c0, axiom,
% 0.12/0.41 ~cn2).
% 0.12/0.41 cnf(c1, plain,
% 0.12/0.41 ~cn2,
% 0.12/0.41 inference(start, [], [c0])).
% 0.12/0.41
% 0.12/0.41 cnf(c2, axiom,
% 0.12/0.41 cn2 | ~is_a_theorem(implies(sK41,implies(not(sK41),sK42)))).
% 0.12/0.41 cnf(c3, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_predicate_extension, [], [c1, c2])).
% 0.12/0.41 cnf(c4, plain,
% 0.12/0.41 ~is_a_theorem(implies(sK41,implies(not(sK41),sK42))),
% 0.12/0.41 inference(strict_predicate_extension, [], [c1, c2])).
% 0.12/0.41
% 0.12/0.41 cnf(c5, axiom,
% 0.12/0.41 is_a_theorem(implies(X0,or(X0,X1))) | ~or_1).
% 0.12/0.41 cnf(a0, assumption,
% 0.12/0.41 X2 = implies(sK41,implies(not(sK41),sK42))).
% 0.12/0.41 cnf(c6, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])).
% 0.12/0.41 cnf(c7, plain,
% 0.12/0.41 ~or_1,
% 0.12/0.41 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])).
% 0.12/0.41 cnf(c8, plain,
% 0.12/0.41 implies(X0,or(X0,X1)) != X2,
% 0.12/0.41 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])).
% 0.12/0.41
% 0.12/0.41 cnf(c9, axiom,
% 0.12/0.41 or(X3,X4) = not(and(not(X3),not(X4))) | ~op_or).
% 0.12/0.41 cnf(a1, assumption,
% 0.12/0.41 or(X0,X1) = or(X3,X4)).
% 0.12/0.41 cnf(c10, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_function_extension, [assumptions([a1])], [c8, c9])).
% 0.12/0.41 cnf(c11, plain,
% 0.12/0.41 ~op_or,
% 0.12/0.41 inference(strict_function_extension, [assumptions([a1])], [c8, c9])).
% 0.12/0.41 cnf(c12, plain,
% 0.12/0.41 X5 != not(and(not(X3),not(X4))) | implies(X0,X5) != X2,
% 0.12/0.41 inference(strict_function_extension, [assumptions([a1])], [c8, c9])).
% 0.12/0.41
% 0.12/0.41 cnf(c13, axiom,
% 0.12/0.41 implies(X6,X7) = not(and(X6,not(X7))) | ~op_implies_and).
% 0.12/0.41 cnf(a2, assumption,
% 0.12/0.41 not(and(not(X3),not(X4))) = not(and(X6,not(X7)))).
% 0.12/0.41 cnf(c14, plain,
% 0.12/0.41 implies(X0,X5) != X2,
% 0.12/0.41 inference(strict_function_extension, [assumptions([a2])], [c12, c13])).
% 0.12/0.41 cnf(c15, plain,
% 0.12/0.41 ~op_implies_and,
% 0.12/0.41 inference(strict_function_extension, [assumptions([a2])], [c12, c13])).
% 0.12/0.41 cnf(c16, plain,
% 0.12/0.41 X8 != implies(X6,X7) | X5 != X8,
% 0.12/0.41 inference(strict_function_extension, [assumptions([a2])], [c12, c13])).
% 0.12/0.41
% 0.12/0.41 cnf(a3, assumption,
% 0.12/0.41 X8 = implies(X6,X7)).
% 0.12/0.41 cnf(c17, plain,
% 0.12/0.41 X5 != X8,
% 0.12/0.41 inference(reflexivity, [assumptions([a3])], [c16])).
% 0.12/0.41
% 0.12/0.41 cnf(a4, assumption,
% 0.12/0.41 X5 = X8).
% 0.12/0.41 cnf(c18, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(reflexivity, [assumptions([a4])], [c17])).
% 0.12/0.41
% 0.12/0.41 cnf(c19, axiom,
% 0.12/0.41 op_implies_and).
% 0.12/0.41 cnf(c20, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_predicate_extension, [], [c15, c19])).
% 0.12/0.41 cnf(c21, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_predicate_extension, [], [c15, c19])).
% 0.12/0.41
% 0.12/0.41 cnf(a5, assumption,
% 0.12/0.41 implies(X0,X5) = X2).
% 0.12/0.41 cnf(c22, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(reflexivity, [assumptions([a5])], [c14])).
% 0.12/0.41
% 0.12/0.41 cnf(c23, axiom,
% 0.12/0.41 op_or).
% 0.12/0.41 cnf(c24, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_predicate_extension, [], [c11, c23])).
% 0.12/0.41 cnf(c25, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_predicate_extension, [], [c11, c23])).
% 0.12/0.41
% 0.12/0.41 cnf(c26, axiom,
% 0.12/0.41 or_1).
% 0.12/0.41 cnf(c27, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_predicate_extension, [], [c7, c26])).
% 0.12/0.41 cnf(c28, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(strict_predicate_extension, [], [c7, c26])).
% 0.12/0.41
% 0.12/0.41 cnf(c29, plain,
% 0.12/0.41 $false,
% 0.12/0.41 inference(constraint_solving, [
% 0.12/0.41 bind(X0, sK41),
% 0.12/0.41 bind(X1, sK42),
% 0.12/0.41 bind(X2, implies(sK41,implies(not(sK41),sK42))),
% 0.12/0.41 bind(X3, sK41),
% 0.12/0.41 bind(X4, sK42),
% 0.12/0.41 bind(X5, implies(X6,X7)),
% 0.12/0.41 bind(X6, not(X3)),
% 0.12/0.41 bind(X7, sK42),
% 0.12/0.41 bind(X8, implies(X6,X7))
% 0.12/0.41 ],
% 0.12/0.41 [a0, a1, a2, a3, a4, a5])).
% 0.12/0.41
% 0.12/0.41 % SZS output end IncompleteProof
%------------------------------------------------------------------------------