TSTP Solution File: GEO498+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO498+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n012.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 : Sat Jul 16 05:01:18 EDT 2022
% Result : Theorem 110.48s 14.71s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO498+1 : TPTP v8.1.0. Released v7.0.0.
% 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Sat Jun 18 13:12:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 110.48/14.71 % SZS status Theorem
% 110.48/14.71 % SZS output begin IncompleteProof
% 110.48/14.71 cnf(c0, axiom,
% 110.48/14.71 sK2 = s(sK0,sK3)).
% 110.48/14.71 cnf(c1, plain,
% 110.48/14.71 sK2 = s(sK0,sK3),
% 110.48/14.71 inference(start, [], [c0])).
% 110.48/14.71
% 110.48/14.71 cnf(c2, axiom,
% 110.48/14.71 s(X0,s(X0,X1)) = X1).
% 110.48/14.71 cnf(a0, assumption,
% 110.48/14.71 s(X0,X1) = s(sK0,sK3)).
% 110.48/14.71 cnf(a1, assumption,
% 110.48/14.71 sK2 = X2).
% 110.48/14.71 cnf(c3, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 110.48/14.71 cnf(c4, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 110.48/14.71 cnf(c5, plain,
% 110.48/14.71 s(X0,X2) = X1,
% 110.48/14.71 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 110.48/14.71
% 110.48/14.71 cnf(c6, axiom,
% 110.48/14.71 s(X3,s(X3,X4)) = X4).
% 110.48/14.71 cnf(a2, assumption,
% 110.48/14.71 s(X5,X6) = s(X0,X2)).
% 110.48/14.71 cnf(c7, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(lazy_subterm_extension, [assumptions([a2])], [c5, c6])).
% 110.48/14.71 cnf(c8, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(lazy_subterm_extension, [assumptions([a2])], [c5, c6])).
% 110.48/14.71 cnf(c9, plain,
% 110.48/14.71 X5 != X3 | X6 != s(X3,X4) | X1 = X4,
% 110.48/14.71 inference(lazy_subterm_extension, [assumptions([a2])], [c5, c6])).
% 110.48/14.71
% 110.48/14.71 cnf(a3, assumption,
% 110.48/14.71 X5 = X3).
% 110.48/14.71 cnf(c10, plain,
% 110.48/14.71 X6 != s(X3,X4) | X1 = X4,
% 110.48/14.71 inference(reflexivity, [assumptions([a3])], [c9])).
% 110.48/14.71
% 110.48/14.71 cnf(c11, axiom,
% 110.48/14.71 sK2 = s(sK0,sK1)).
% 110.48/14.71 cnf(a4, assumption,
% 110.48/14.71 s(X3,X4) = s(sK0,sK1)).
% 110.48/14.71 cnf(c12, plain,
% 110.48/14.71 X1 = X4,
% 110.48/14.71 inference(strict_function_extension, [assumptions([a4])], [c10, c11])).
% 110.48/14.71 cnf(c13, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(strict_function_extension, [assumptions([a4])], [c10, c11])).
% 110.48/14.71 cnf(c14, plain,
% 110.48/14.71 X7 != sK2 | X6 != X7,
% 110.48/14.71 inference(strict_function_extension, [assumptions([a4])], [c10, c11])).
% 110.48/14.71
% 110.48/14.71 cnf(a5, assumption,
% 110.48/14.71 X7 = sK2).
% 110.48/14.71 cnf(c15, plain,
% 110.48/14.71 X6 != X7,
% 110.48/14.71 inference(reflexivity, [assumptions([a5])], [c14])).
% 110.48/14.71
% 110.48/14.71 cnf(a6, assumption,
% 110.48/14.71 X6 = X7).
% 110.48/14.71 cnf(c16, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(reflexivity, [assumptions([a6])], [c15])).
% 110.48/14.71
% 110.48/14.71 cnf(c17, axiom,
% 110.48/14.71 sK1 != sK3).
% 110.48/14.71 cnf(a7, assumption,
% 110.48/14.71 sK3 = X1).
% 110.48/14.71 cnf(c18, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(strict_subterm_extension, [assumptions([a7])], [c12, c17])).
% 110.48/14.71 cnf(c19, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(strict_subterm_extension, [assumptions([a7])], [c12, c17])).
% 110.48/14.71 cnf(c20, plain,
% 110.48/14.71 sK1 != X4,
% 110.48/14.71 inference(strict_subterm_extension, [assumptions([a7])], [c12, c17])).
% 110.48/14.71
% 110.48/14.71 cnf(a8, assumption,
% 110.48/14.71 sK1 = X4).
% 110.48/14.71 cnf(c21, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(reflexivity, [assumptions([a8])], [c20])).
% 110.48/14.71
% 110.48/14.71 cnf(c22, plain,
% 110.48/14.71 $false,
% 110.48/14.71 inference(constraint_solving, [
% 110.48/14.71 bind(X0, sK0),
% 110.48/14.71 bind(X1, sK3),
% 110.48/14.71 bind(X2, sK2),
% 110.48/14.71 bind(X3, sK0),
% 110.48/14.71 bind(X4, sK1),
% 110.48/14.71 bind(X5, sK0),
% 110.48/14.71 bind(X6, sK2),
% 110.48/14.71 bind(X7, sK2)
% 110.48/14.71 ],
% 110.48/14.71 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 110.48/14.71
% 110.48/14.71 % SZS output end IncompleteProof
%------------------------------------------------------------------------------