TSTP Solution File: ALG177+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : ALG177+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n018.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 : Thu Jul 14 17:20:45 EDT 2022
% Result : Theorem 15.13s 2.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ALG177+1 : TPTP v8.1.0. Released v2.7.0.
% 0.12/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 : Thu Jun 9 02:28:52 EDT 2022
% 0.14/0.36 % CPUTime :
% 15.13/2.33 % SZS status Theorem
% 15.13/2.33 % SZS output begin IncompleteProof
% 15.13/2.33 cnf(c0, axiom,
% 15.13/2.33 sorti2(h(X0)) | ~sorti1(X0)).
% 15.13/2.33 cnf(c1, plain,
% 15.13/2.33 sorti2(h(X0)) | ~sorti1(X0),
% 15.13/2.33 inference(start, [], [c0])).
% 15.13/2.33
% 15.13/2.33 cnf(c2, axiom,
% 15.13/2.33 sK1(X1) = op2(X1,sK1(X1)) | ~sorti2(X1)).
% 15.13/2.33 cnf(a0, assumption,
% 15.13/2.33 h(X0) = X1).
% 15.13/2.33 cnf(c3, plain,
% 15.13/2.33 ~sorti1(X0),
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 15.13/2.33 cnf(c4, plain,
% 15.13/2.33 sK1(X1) = op2(X1,sK1(X1)),
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 15.13/2.33
% 15.13/2.33 cnf(c5, axiom,
% 15.13/2.33 j(op2(X2,X3)) = op1(j(X2),j(X3)) | ~sorti2(X3) | ~sorti2(X2)).
% 15.13/2.33 cnf(a1, assumption,
% 15.13/2.33 op2(X2,X3) = op2(X1,sK1(X1))).
% 15.13/2.33 cnf(a2, assumption,
% 15.13/2.33 sK1(X1) = X4).
% 15.13/2.33 cnf(c6, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 15.13/2.33 cnf(c7, plain,
% 15.13/2.33 ~sorti2(X3) | ~sorti2(X2),
% 15.13/2.33 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 15.13/2.33 cnf(c8, plain,
% 15.13/2.33 j(X4) = op1(j(X2),j(X3)),
% 15.13/2.33 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 15.13/2.33
% 15.13/2.33 cnf(c9, axiom,
% 15.13/2.33 j(h(X5)) = X5 | ~sorti1(X5)).
% 15.13/2.33 cnf(a3, assumption,
% 15.13/2.33 j(X2) = j(h(X5))).
% 15.13/2.33 cnf(c10, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(strict_function_extension, [assumptions([a3])], [c8, c9])).
% 15.13/2.33 cnf(c11, plain,
% 15.13/2.33 ~sorti1(X5),
% 15.13/2.33 inference(strict_function_extension, [assumptions([a3])], [c8, c9])).
% 15.13/2.33 cnf(c12, plain,
% 15.13/2.33 X6 != X5 | j(X4) = op1(X6,j(X3)),
% 15.13/2.33 inference(strict_function_extension, [assumptions([a3])], [c8, c9])).
% 15.13/2.33
% 15.13/2.33 cnf(a4, assumption,
% 15.13/2.33 X6 = X5).
% 15.13/2.33 cnf(c13, plain,
% 15.13/2.33 j(X4) = op1(X6,j(X3)),
% 15.13/2.33 inference(reflexivity, [assumptions([a4])], [c12])).
% 15.13/2.33
% 15.13/2.33 cnf(c14, axiom,
% 15.13/2.33 op1(sK0,X7) != X7 | ~sorti1(X7)).
% 15.13/2.33 cnf(a5, assumption,
% 15.13/2.33 op1(sK0,X7) = op1(X6,j(X3))).
% 15.13/2.33 cnf(a6, assumption,
% 15.13/2.33 j(X4) = X8).
% 15.13/2.33 cnf(c15, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(strict_subterm_extension, [assumptions([a5, a6])], [c13, c14])).
% 15.13/2.33 cnf(c16, plain,
% 15.13/2.33 ~sorti1(X7),
% 15.13/2.33 inference(strict_subterm_extension, [assumptions([a5, a6])], [c13, c14])).
% 15.13/2.33 cnf(c17, plain,
% 15.13/2.33 X8 != X7,
% 15.13/2.33 inference(strict_subterm_extension, [assumptions([a5, a6])], [c13, c14])).
% 15.13/2.33
% 15.13/2.33 cnf(a7, assumption,
% 15.13/2.33 X8 = X7).
% 15.13/2.33 cnf(c18, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(reflexivity, [assumptions([a7])], [c17])).
% 15.13/2.33
% 15.13/2.33 cnf(c19, axiom,
% 15.13/2.33 sorti1(j(X9)) | ~sorti2(X9)).
% 15.13/2.33 cnf(a8, assumption,
% 15.13/2.33 X7 = j(X9)).
% 15.13/2.33 cnf(c20, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a8])], [c16, c19])).
% 15.13/2.33 cnf(c21, plain,
% 15.13/2.33 ~sorti2(X9),
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a8])], [c16, c19])).
% 15.13/2.33
% 15.13/2.33 cnf(c22, axiom,
% 15.13/2.33 sorti2(sK1(X10)) | ~sorti2(X10)).
% 15.13/2.33 cnf(a9, assumption,
% 15.13/2.33 X9 = sK1(X10)).
% 15.13/2.33 cnf(c23, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a9])], [c21, c22])).
% 15.13/2.33 cnf(c24, plain,
% 15.13/2.33 ~sorti2(X10),
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a9])], [c21, c22])).
% 15.13/2.33
% 15.13/2.33 cnf(c25, plain,
% 15.13/2.33 sorti2(h(X0))).
% 15.13/2.33 cnf(a10, assumption,
% 15.13/2.33 X10 = h(X0)).
% 15.13/2.33 cnf(c26, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(predicate_reduction, [assumptions([a10])], [c24, c25])).
% 15.13/2.33
% 15.13/2.33 cnf(c27, axiom,
% 15.13/2.33 sorti1(sK0)).
% 15.13/2.33 cnf(a11, assumption,
% 15.13/2.33 X5 = sK0).
% 15.13/2.33 cnf(c28, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a11])], [c11, c27])).
% 15.13/2.33 cnf(c29, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(strict_predicate_extension, [assumptions([a11])], [c11, c27])).
% 15.13/2.33
% 15.13/2.33 cnf(c30, plain,
% 15.13/2.33 sorti2(X9)).
% 15.13/2.33 cnf(a12, assumption,
% 15.13/2.33 X3 = X9).
% 15.13/2.33 cnf(c31, plain,
% 15.13/2.33 ~sorti2(X2),
% 15.13/2.33 inference(predicate_reduction, [assumptions([a12])], [c7, c30])).
% 15.13/2.33
% 15.13/2.33 cnf(c32, plain,
% 15.13/2.33 sorti2(h(X0))).
% 15.13/2.33 cnf(a13, assumption,
% 15.13/2.33 X2 = h(X0)).
% 15.13/2.33 cnf(c33, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(predicate_reduction, [assumptions([a13])], [c31, c32])).
% 15.13/2.33
% 15.13/2.33 cnf(c34, plain,
% 15.13/2.33 sorti1(X5)).
% 15.13/2.33 cnf(a14, assumption,
% 15.13/2.33 X0 = X5).
% 15.13/2.33 cnf(c35, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(predicate_reduction, [assumptions([a14])], [c3, c34])).
% 15.13/2.33
% 15.13/2.33 cnf(c36, plain,
% 15.13/2.33 $false,
% 15.13/2.33 inference(constraint_solving, [
% 15.13/2.33 bind(X0, sK0),
% 15.13/2.33 bind(X1, h(X0)),
% 15.13/2.33 bind(X2, h(X0)),
% 15.13/2.33 bind(X3, sK1(X1)),
% 15.13/2.33 bind(X4, sK1(X1)),
% 15.13/2.33 bind(X5, sK0),
% 15.13/2.33 bind(X6, sK0),
% 15.13/2.33 bind(X7, j(X3)),
% 15.13/2.33 bind(X8, j(X4)),
% 15.13/2.33 bind(X9, sK1(X1)),
% 15.13/2.33 bind(X10, h(X0))
% 15.13/2.33 ],
% 15.13/2.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 15.13/2.33
% 15.13/2.33 % SZS output end IncompleteProof
%------------------------------------------------------------------------------