TSTP Solution File: ALG201+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : ALG201+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 : n025.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:47 EDT 2022
% Result : Theorem 0.20s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG201+1 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 8 11:17:49 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.35 % SZS status Theorem
% 0.20/0.35 % SZS output begin IncompleteProof
% 0.20/0.35 cnf(c0, axiom,
% 0.20/0.35 j(op2(X0,X1)) = op1(j(X0),j(X1)) | ~sorti2(X1) | ~sorti2(X0)).
% 0.20/0.35 cnf(c1, plain,
% 0.20/0.35 j(op2(X0,X1)) = op1(j(X0),j(X1)) | ~sorti2(X1) | ~sorti2(X0),
% 0.20/0.35 inference(start, [], [c0])).
% 0.20/0.35
% 0.20/0.35 cnf(c2, axiom,
% 0.20/0.35 sK0 = op2(sK0,sK0)).
% 0.20/0.35 cnf(a0, assumption,
% 0.20/0.35 op2(X0,X1) = op2(sK0,sK0)).
% 0.20/0.35 cnf(c3, plain,
% 0.20/0.35 ~sorti2(X1) | ~sorti2(X0),
% 0.20/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.35 cnf(c4, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.35 cnf(c5, plain,
% 0.20/0.35 X2 != sK0 | j(X2) = op1(j(X0),j(X1)),
% 0.20/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.35
% 0.20/0.35 cnf(a1, assumption,
% 0.20/0.35 X2 = sK0).
% 0.20/0.35 cnf(c6, plain,
% 0.20/0.35 j(X2) = op1(j(X0),j(X1)),
% 0.20/0.35 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.20/0.35
% 0.20/0.35 cnf(c7, axiom,
% 0.20/0.35 op1(X3,X3) != X3 | ~sorti1(X3)).
% 0.20/0.35 cnf(a2, assumption,
% 0.20/0.35 op1(X3,X3) = op1(j(X0),j(X1))).
% 0.20/0.35 cnf(a3, assumption,
% 0.20/0.35 j(X2) = X4).
% 0.20/0.35 cnf(c8, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(strict_subterm_extension, [assumptions([a2, a3])], [c6, c7])).
% 0.20/0.35 cnf(c9, plain,
% 0.20/0.35 ~sorti1(X3),
% 0.20/0.35 inference(strict_subterm_extension, [assumptions([a2, a3])], [c6, c7])).
% 0.20/0.35 cnf(c10, plain,
% 0.20/0.35 X4 != X3,
% 0.20/0.35 inference(strict_subterm_extension, [assumptions([a2, a3])], [c6, c7])).
% 0.20/0.35
% 0.20/0.35 cnf(a4, assumption,
% 0.20/0.35 X4 = X3).
% 0.20/0.35 cnf(c11, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(reflexivity, [assumptions([a4])], [c10])).
% 0.20/0.35
% 0.20/0.35 cnf(c12, axiom,
% 0.20/0.35 sorti1(j(X5)) | ~sorti2(X5)).
% 0.20/0.35 cnf(a5, assumption,
% 0.20/0.35 X3 = j(X5)).
% 0.20/0.35 cnf(c13, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c9, c12])).
% 0.20/0.35 cnf(c14, plain,
% 0.20/0.35 ~sorti2(X5),
% 0.20/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c9, c12])).
% 0.20/0.35
% 0.20/0.35 cnf(c15, axiom,
% 0.20/0.35 sorti2(sK0)).
% 0.20/0.35 cnf(a6, assumption,
% 0.20/0.35 X5 = sK0).
% 0.20/0.35 cnf(c16, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c14, c15])).
% 0.20/0.35 cnf(c17, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c14, c15])).
% 0.20/0.35
% 0.20/0.35 cnf(c18, plain,
% 0.20/0.35 sorti2(X5)).
% 0.20/0.35 cnf(a7, assumption,
% 0.20/0.35 X1 = X5).
% 0.20/0.35 cnf(c19, plain,
% 0.20/0.35 ~sorti2(X0),
% 0.20/0.35 inference(predicate_reduction, [assumptions([a7])], [c3, c18])).
% 0.20/0.35
% 0.20/0.35 cnf(c20, plain,
% 0.20/0.35 sorti2(X5)).
% 0.20/0.35 cnf(a8, assumption,
% 0.20/0.35 X0 = X5).
% 0.20/0.35 cnf(c21, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(predicate_reduction, [assumptions([a8])], [c19, c20])).
% 0.20/0.35
% 0.20/0.35 cnf(c22, plain,
% 0.20/0.35 $false,
% 0.20/0.35 inference(constraint_solving, [
% 0.20/0.35 bind(X0, sK0),
% 0.20/0.35 bind(X1, sK0),
% 0.20/0.35 bind(X2, sK0),
% 0.20/0.35 bind(X3, j(X0)),
% 0.20/0.35 bind(X4, j(X2)),
% 0.20/0.35 bind(X5, sK0)
% 0.20/0.35 ],
% 0.20/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.20/0.35
% 0.20/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------