TSTP Solution File: LCL536+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL536+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 : n007.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:42 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL536+1 : TPTP v8.1.0. Released v3.3.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.34 % Computer : n007.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 15:16:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.39 % SZS status Theorem
% 0.12/0.39 % SZS output begin IncompleteProof
% 0.12/0.39 cnf(c0, axiom,
% 0.12/0.39 ~axiom_m10).
% 0.12/0.39 cnf(c1, plain,
% 0.12/0.39 ~axiom_m10,
% 0.12/0.39 inference(start, [], [c0])).
% 0.12/0.39
% 0.12/0.39 cnf(c2, axiom,
% 0.12/0.39 axiom_m10 | ~is_a_theorem(strict_implies(possibly(sK93),necessarily(possibly(sK93))))).
% 0.12/0.39 cnf(c3, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [], [c1, c2])).
% 0.12/0.39 cnf(c4, plain,
% 0.12/0.39 ~is_a_theorem(strict_implies(possibly(sK93),necessarily(possibly(sK93)))),
% 0.12/0.39 inference(strict_predicate_extension, [], [c1, c2])).
% 0.12/0.39
% 0.12/0.39 cnf(c5, axiom,
% 0.12/0.39 strict_implies(X0,X1) = necessarily(implies(X0,X1)) | ~op_strict_implies).
% 0.12/0.39 cnf(a0, assumption,
% 0.12/0.39 strict_implies(possibly(sK93),necessarily(possibly(sK93))) = strict_implies(X0,X1)).
% 0.12/0.39 cnf(c6, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.12/0.39 cnf(c7, plain,
% 0.12/0.39 ~op_strict_implies,
% 0.12/0.39 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.12/0.39 cnf(c8, plain,
% 0.12/0.39 X2 != necessarily(implies(X0,X1)) | ~is_a_theorem(X2),
% 0.12/0.39 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.12/0.39
% 0.12/0.39 cnf(a1, assumption,
% 0.12/0.39 X2 = necessarily(implies(X0,X1))).
% 0.12/0.39 cnf(c9, plain,
% 0.12/0.39 ~is_a_theorem(X2),
% 0.12/0.39 inference(reflexivity, [assumptions([a1])], [c8])).
% 0.12/0.39
% 0.12/0.39 cnf(c10, axiom,
% 0.12/0.39 is_a_theorem(necessarily(X3)) | ~is_a_theorem(X3) | ~necessitation).
% 0.12/0.39 cnf(a2, assumption,
% 0.12/0.39 X2 = necessarily(X3)).
% 0.12/0.39 cnf(c11, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a2])], [c9, c10])).
% 0.12/0.39 cnf(c12, plain,
% 0.12/0.39 ~is_a_theorem(X3) | ~necessitation,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a2])], [c9, c10])).
% 0.12/0.39
% 0.12/0.39 cnf(c13, axiom,
% 0.12/0.39 is_a_theorem(implies(possibly(X4),necessarily(possibly(X4)))) | ~axiom_5).
% 0.12/0.39 cnf(a3, assumption,
% 0.12/0.39 X3 = implies(possibly(X4),necessarily(possibly(X4)))).
% 0.12/0.39 cnf(c14, plain,
% 0.12/0.39 ~necessitation,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a3])], [c12, c13])).
% 0.12/0.39 cnf(c15, plain,
% 0.12/0.39 ~axiom_5,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a3])], [c12, c13])).
% 0.12/0.39
% 0.12/0.39 cnf(c16, axiom,
% 0.12/0.39 axiom_5).
% 0.12/0.39 cnf(c17, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [], [c15, c16])).
% 0.12/0.39 cnf(c18, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [], [c15, c16])).
% 0.12/0.39
% 0.12/0.39 cnf(c19, axiom,
% 0.12/0.39 necessitation).
% 0.12/0.39 cnf(c20, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [], [c14, c19])).
% 0.12/0.39 cnf(c21, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [], [c14, c19])).
% 0.12/0.39
% 0.12/0.39 cnf(c22, axiom,
% 0.12/0.39 op_strict_implies).
% 0.12/0.39 cnf(c23, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [], [c7, c22])).
% 0.12/0.39 cnf(c24, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [], [c7, c22])).
% 0.12/0.39
% 0.12/0.39 cnf(c25, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(constraint_solving, [
% 0.12/0.39 bind(X0, possibly(sK93)),
% 0.12/0.39 bind(X1, necessarily(possibly(sK93))),
% 0.12/0.39 bind(X2, necessarily(implies(X0,X1))),
% 0.12/0.39 bind(X3, implies(X0,X1)),
% 0.12/0.39 bind(X4, sK93)
% 0.12/0.39 ],
% 0.12/0.39 [a0, a1, a2, a3])).
% 0.12/0.39
% 0.12/0.39 % SZS output end IncompleteProof
%------------------------------------------------------------------------------