TSTP Solution File: ALG041+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : ALG041+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 : n022.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:26 EDT 2022
% Result : Theorem 34.17s 4.70s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG041+1 : TPTP v8.1.0. Released v2.7.0.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.18/0.34 % DateTime : Wed Jun 8 20:11:49 EDT 2022
% 0.18/0.34 % CPUTime :
% 34.17/4.70 % SZS status Theorem
% 34.17/4.70 % SZS output begin IncompleteProof
% 34.17/4.70 cnf(c0, axiom,
% 34.17/4.70 h(op1(X0,X1)) = op2(h(X0),h(X1)) | ~sorti1(X1) | ~sorti1(X0)).
% 34.17/4.70 cnf(c1, plain,
% 34.17/4.70 h(op1(X0,X1)) = op2(h(X0),h(X1)) | ~sorti1(X1) | ~sorti1(X0),
% 34.17/4.70 inference(start, [], [c0])).
% 34.17/4.70
% 34.17/4.70 cnf(c2, axiom,
% 34.17/4.70 op2(X2,X2) = sK1 | ~sorti2(X2)).
% 34.17/4.70 cnf(a0, assumption,
% 34.17/4.70 op2(X2,X2) = op2(h(X0),h(X1))).
% 34.17/4.70 cnf(a1, assumption,
% 34.17/4.70 h(op1(X0,X1)) = X3).
% 34.17/4.70 cnf(c3, plain,
% 34.17/4.70 ~sorti1(X1) | ~sorti1(X0),
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 34.17/4.70 cnf(c4, plain,
% 34.17/4.70 ~sorti2(X2),
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 34.17/4.70 cnf(c5, plain,
% 34.17/4.70 X3 = sK1,
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 34.17/4.70
% 34.17/4.70 cnf(c6, axiom,
% 34.17/4.70 j(h(X4)) = X4 | ~sorti1(X4)).
% 34.17/4.70 cnf(a2, assumption,
% 34.17/4.70 h(X4) = X3).
% 34.17/4.70 cnf(a3, assumption,
% 34.17/4.70 sK1 = X5).
% 34.17/4.70 cnf(c7, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 34.17/4.70 cnf(c8, plain,
% 34.17/4.70 ~sorti1(X4),
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 34.17/4.70 cnf(c9, plain,
% 34.17/4.70 j(X5) = X4,
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 34.17/4.70
% 34.17/4.70 cnf(c10, axiom,
% 34.17/4.70 op1(sK0(X6),sK0(X6)) != X6 | ~sorti1(X6)).
% 34.17/4.70 cnf(a4, assumption,
% 34.17/4.70 op1(sK0(X6),sK0(X6)) = X4).
% 34.17/4.70 cnf(a5, assumption,
% 34.17/4.70 j(X5) = X7).
% 34.17/4.70 cnf(c11, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])).
% 34.17/4.70 cnf(c12, plain,
% 34.17/4.70 ~sorti1(X6),
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])).
% 34.17/4.70 cnf(c13, plain,
% 34.17/4.70 X7 != X6,
% 34.17/4.70 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])).
% 34.17/4.70
% 34.17/4.70 cnf(a6, assumption,
% 34.17/4.70 X7 = X6).
% 34.17/4.70 cnf(c14, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(reflexivity, [assumptions([a6])], [c13])).
% 34.17/4.70
% 34.17/4.70 cnf(c15, axiom,
% 34.17/4.70 sorti1(j(X8)) | ~sorti2(X8)).
% 34.17/4.70 cnf(a7, assumption,
% 34.17/4.70 X6 = j(X8)).
% 34.17/4.70 cnf(c16, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a7])], [c12, c15])).
% 34.17/4.70 cnf(c17, plain,
% 34.17/4.70 ~sorti2(X8),
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a7])], [c12, c15])).
% 34.17/4.70
% 34.17/4.70 cnf(c18, axiom,
% 34.17/4.70 sorti2(sK1)).
% 34.17/4.70 cnf(a8, assumption,
% 34.17/4.70 X8 = sK1).
% 34.17/4.70 cnf(c19, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])).
% 34.17/4.70 cnf(c20, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])).
% 34.17/4.70
% 34.17/4.70 cnf(c21, axiom,
% 34.17/4.70 sorti1(op1(X9,X10)) | ~sorti1(X10) | ~sorti1(X9)).
% 34.17/4.70 cnf(a9, assumption,
% 34.17/4.70 X4 = op1(X9,X10)).
% 34.17/4.70 cnf(c22, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a9])], [c8, c21])).
% 34.17/4.70 cnf(c23, plain,
% 34.17/4.70 ~sorti1(X10) | ~sorti1(X9),
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a9])], [c8, c21])).
% 34.17/4.70
% 34.17/4.70 cnf(c24, axiom,
% 34.17/4.70 sorti1(sK0(X11)) | ~sorti1(X11)).
% 34.17/4.70 cnf(a10, assumption,
% 34.17/4.70 X10 = sK0(X11)).
% 34.17/4.70 cnf(c25, plain,
% 34.17/4.70 ~sorti1(X9),
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a10])], [c23, c24])).
% 34.17/4.70 cnf(c26, plain,
% 34.17/4.70 ~sorti1(X11),
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a10])], [c23, c24])).
% 34.17/4.70
% 34.17/4.70 cnf(c27, plain,
% 34.17/4.70 sorti1(X6)).
% 34.17/4.70 cnf(a11, assumption,
% 34.17/4.70 X11 = X6).
% 34.17/4.70 cnf(c28, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(predicate_reduction, [assumptions([a11])], [c26, c27])).
% 34.17/4.70
% 34.17/4.70 cnf(c29, plain,
% 34.17/4.70 sorti1(X10)).
% 34.17/4.70 cnf(a12, assumption,
% 34.17/4.70 X9 = X10).
% 34.17/4.70 cnf(c30, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(predicate_reduction, [assumptions([a12])], [c25, c29])).
% 34.17/4.70
% 34.17/4.70 cnf(c31, axiom,
% 34.17/4.70 sorti2(h(X12)) | ~sorti1(X12)).
% 34.17/4.70 cnf(a13, assumption,
% 34.17/4.70 X2 = h(X12)).
% 34.17/4.70 cnf(c32, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a13])], [c4, c31])).
% 34.17/4.70 cnf(c33, plain,
% 34.17/4.70 ~sorti1(X12),
% 34.17/4.70 inference(strict_predicate_extension, [assumptions([a13])], [c4, c31])).
% 34.17/4.70
% 34.17/4.70 cnf(c34, plain,
% 34.17/4.70 sorti1(X10)).
% 34.17/4.70 cnf(a14, assumption,
% 34.17/4.70 X12 = X10).
% 34.17/4.70 cnf(c35, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(predicate_reduction, [assumptions([a14])], [c33, c34])).
% 34.17/4.70
% 34.17/4.70 cnf(c36, plain,
% 34.17/4.70 sorti1(X10)).
% 34.17/4.70 cnf(a15, assumption,
% 34.17/4.70 X1 = X10).
% 34.17/4.70 cnf(c37, plain,
% 34.17/4.70 ~sorti1(X0),
% 34.17/4.70 inference(predicate_reduction, [assumptions([a15])], [c3, c36])).
% 34.17/4.70
% 34.17/4.70 cnf(c38, plain,
% 34.17/4.70 sorti1(X10)).
% 34.17/4.70 cnf(a16, assumption,
% 34.17/4.70 X0 = X10).
% 34.17/4.70 cnf(c39, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(predicate_reduction, [assumptions([a16])], [c37, c38])).
% 34.17/4.70
% 34.17/4.70 cnf(c40, plain,
% 34.17/4.70 $false,
% 34.17/4.70 inference(constraint_solving, [
% 34.17/4.70 bind(X0, sK0(X6)),
% 34.17/4.70 bind(X1, sK0(X6)),
% 34.17/4.70 bind(X2, h(X0)),
% 34.17/4.70 bind(X3, h(op1(X0,X1))),
% 34.17/4.70 bind(X4, op1(X0,X1)),
% 34.17/4.70 bind(X5, sK1),
% 34.17/4.70 bind(X6, j(X5)),
% 34.17/4.70 bind(X7, j(X5)),
% 34.17/4.70 bind(X8, sK1),
% 34.17/4.70 bind(X9, sK0(X6)),
% 34.17/4.70 bind(X10, sK0(X6)),
% 34.17/4.70 bind(X11, j(X5)),
% 34.17/4.70 bind(X12, sK0(X6))
% 34.17/4.70 ],
% 34.17/4.70 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 34.17/4.70
% 34.17/4.70 % SZS output end IncompleteProof
%------------------------------------------------------------------------------