TSTP Solution File: NUM835+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM835+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n026.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 : Mon Jul 18 11:36:57 EDT 2022
% Result : Theorem 5.35s 1.07s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM835+1 : TPTP v8.1.0. Released v4.1.0.
% 0.09/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n026.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 Jul 6 10:08:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 5.35/1.07 % SZS status Theorem
% 5.35/1.07 % SZS output begin IncompleteProof
% 5.35/1.07 cnf(c0, axiom,
% 5.35/1.07 vd151 != vplus(vd165,X0)).
% 5.35/1.07 cnf(c1, plain,
% 5.35/1.07 vd151 != vplus(vd165,X0),
% 5.35/1.07 inference(start, [], [c0])).
% 5.35/1.07
% 5.35/1.07 cnf(c2, axiom,
% 5.35/1.07 vplus(X1,sK2(X1,X2)) = X2 | vplus(X2,sK3(X1,X2)) = X1 | X1 = X2 | ~m(X2)).
% 5.35/1.07 cnf(a0, assumption,
% 5.35/1.07 vplus(vd165,X0) = vplus(X2,sK3(X1,X2))).
% 5.35/1.07 cnf(c3, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 5.35/1.07 cnf(c4, plain,
% 5.35/1.07 vplus(X1,sK2(X1,X2)) = X2 | X1 = X2 | ~m(X2),
% 5.35/1.07 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 5.35/1.07 cnf(c5, plain,
% 5.35/1.07 X3 != X1 | vd151 != X3,
% 5.35/1.07 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 5.35/1.07
% 5.35/1.07 cnf(a1, assumption,
% 5.35/1.07 X3 = X1).
% 5.35/1.07 cnf(c6, plain,
% 5.35/1.07 vd151 != X3,
% 5.35/1.07 inference(reflexivity, [assumptions([a1])], [c5])).
% 5.35/1.07
% 5.35/1.07 cnf(a2, assumption,
% 5.35/1.07 vd151 = X3).
% 5.35/1.07 cnf(c7, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(reflexivity, [assumptions([a2])], [c6])).
% 5.35/1.07
% 5.35/1.07 cnf(c8, axiom,
% 5.35/1.07 vd165 != vplus(vd151,X4)).
% 5.35/1.07 cnf(a3, assumption,
% 5.35/1.07 vplus(vd151,X4) = vplus(X1,sK2(X1,X2))).
% 5.35/1.07 cnf(c9, plain,
% 5.35/1.07 X1 = X2 | ~m(X2),
% 5.35/1.07 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 5.35/1.07 cnf(c10, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 5.35/1.07 cnf(c11, plain,
% 5.35/1.07 vd165 != X2,
% 5.35/1.07 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 5.35/1.07
% 5.35/1.07 cnf(a4, assumption,
% 5.35/1.07 vd165 = X2).
% 5.35/1.07 cnf(c12, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(reflexivity, [assumptions([a4])], [c11])).
% 5.35/1.07
% 5.35/1.07 cnf(c13, axiom,
% 5.35/1.07 vd165 != vd151).
% 5.35/1.07 cnf(a5, assumption,
% 5.35/1.07 vd151 = X1).
% 5.35/1.07 cnf(c14, plain,
% 5.35/1.07 ~m(X2),
% 5.35/1.07 inference(strict_subterm_extension, [assumptions([a5])], [c9, c13])).
% 5.35/1.07 cnf(c15, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(strict_subterm_extension, [assumptions([a5])], [c9, c13])).
% 5.35/1.07 cnf(c16, plain,
% 5.35/1.07 vd165 != X2,
% 5.35/1.07 inference(strict_subterm_extension, [assumptions([a5])], [c9, c13])).
% 5.35/1.07
% 5.35/1.07 cnf(a6, assumption,
% 5.35/1.07 vd165 = X2).
% 5.35/1.07 cnf(c17, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(reflexivity, [assumptions([a6])], [c16])).
% 5.35/1.07
% 5.35/1.07 cnf(c18, axiom,
% 5.35/1.07 m(vd165)).
% 5.35/1.07 cnf(a7, assumption,
% 5.35/1.07 X2 = vd165).
% 5.35/1.07 cnf(c19, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(strict_predicate_extension, [assumptions([a7])], [c14, c18])).
% 5.35/1.07 cnf(c20, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(strict_predicate_extension, [assumptions([a7])], [c14, c18])).
% 5.35/1.07
% 5.35/1.07 cnf(c21, plain,
% 5.35/1.07 $false,
% 5.35/1.07 inference(constraint_solving, [
% 5.35/1.07 bind(X0, sK3(X1,X2)),
% 5.35/1.07 bind(X1, vd151),
% 5.35/1.07 bind(X2, vd165),
% 5.35/1.07 bind(X3, vd151),
% 5.35/1.07 bind(X4, sK2(X1,X2))
% 5.35/1.07 ],
% 5.35/1.07 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 5.35/1.07
% 5.35/1.07 % SZS output end IncompleteProof
%------------------------------------------------------------------------------