TSTP Solution File: GEO299+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO299+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 : 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 : Sat Jul 16 05:00:34 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GEO299+1 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.31 % Computer : n022.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sat Jun 18 14:38:17 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.19/0.50 % SZS status Theorem
% 0.19/0.50 % SZS output begin IncompleteProof
% 0.19/0.50 cnf(c0, axiom,
% 0.19/0.50 vf(sK45,sK47) != vplus(vf(sK45,sK40),vf(sK40,sK47))).
% 0.19/0.50 cnf(c1, plain,
% 0.19/0.50 vf(sK45,sK47) != vplus(vf(sK45,sK40),vf(sK40,sK47)),
% 0.19/0.50 inference(start, [], [c0])).
% 0.19/0.50
% 0.19/0.50 cnf(c2, axiom,
% 0.19/0.50 vf(X0,X1) = vplus(vf(X0,X2),vf(X2,X1)) | ~rpoint(X0) | ~rpoint(X2) | ~rpoint(X1) | ~rR(X2,X0,X1)).
% 0.19/0.50 cnf(a0, assumption,
% 0.19/0.50 vplus(vf(sK45,sK40),vf(sK40,sK47)) = vplus(vf(X0,X2),vf(X2,X1))).
% 0.19/0.50 cnf(c3, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.50 cnf(c4, plain,
% 0.19/0.50 ~rpoint(X0) | ~rpoint(X2) | ~rpoint(X1) | ~rR(X2,X0,X1),
% 0.19/0.50 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.50 cnf(c5, plain,
% 0.19/0.50 X3 != vf(X0,X1) | vf(sK45,sK47) != X3,
% 0.19/0.50 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.50
% 0.19/0.50 cnf(a1, assumption,
% 0.19/0.50 X3 = vf(X0,X1)).
% 0.19/0.50 cnf(c6, plain,
% 0.19/0.50 vf(sK45,sK47) != X3,
% 0.19/0.50 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.19/0.50
% 0.19/0.50 cnf(a2, assumption,
% 0.19/0.50 vf(sK45,sK47) = X3).
% 0.19/0.50 cnf(c7, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.19/0.50
% 0.19/0.50 cnf(c8, axiom,
% 0.19/0.50 rpoint(sK45)).
% 0.19/0.50 cnf(a3, assumption,
% 0.19/0.50 X0 = sK45).
% 0.19/0.50 cnf(c9, plain,
% 0.19/0.50 ~rpoint(X2) | ~rpoint(X1) | ~rR(X2,X0,X1),
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a3])], [c4, c8])).
% 0.19/0.50 cnf(c10, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a3])], [c4, c8])).
% 0.19/0.50
% 0.19/0.50 cnf(c11, axiom,
% 0.19/0.50 rpoint(sK40)).
% 0.19/0.50 cnf(a4, assumption,
% 0.19/0.50 X2 = sK40).
% 0.19/0.50 cnf(c12, plain,
% 0.19/0.50 ~rpoint(X1) | ~rR(X2,X0,X1),
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a4])], [c9, c11])).
% 0.19/0.50 cnf(c13, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a4])], [c9, c11])).
% 0.19/0.50
% 0.19/0.50 cnf(c14, axiom,
% 0.19/0.50 rpoint(sK47)).
% 0.19/0.50 cnf(a5, assumption,
% 0.19/0.50 X1 = sK47).
% 0.19/0.50 cnf(c15, plain,
% 0.19/0.50 ~rR(X2,X0,X1),
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a5])], [c12, c14])).
% 0.19/0.50 cnf(c16, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a5])], [c12, c14])).
% 0.19/0.50
% 0.19/0.50 cnf(c17, axiom,
% 0.19/0.50 rR(sK40,sK45,sK47)).
% 0.19/0.50 cnf(a6, assumption,
% 0.19/0.50 X2 = sK40).
% 0.19/0.50 cnf(a7, assumption,
% 0.19/0.50 X0 = sK45).
% 0.19/0.50 cnf(a8, assumption,
% 0.19/0.50 X1 = sK47).
% 0.19/0.50 cnf(c18, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c15, c17])).
% 0.19/0.50 cnf(c19, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c15, c17])).
% 0.19/0.50
% 0.19/0.50 cnf(c20, plain,
% 0.19/0.50 $false,
% 0.19/0.50 inference(constraint_solving, [
% 0.19/0.50 bind(X0, sK45),
% 0.19/0.50 bind(X1, sK47),
% 0.19/0.50 bind(X2, sK40),
% 0.19/0.50 bind(X3, vf(X0,X1))
% 0.19/0.50 ],
% 0.19/0.50 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.19/0.50
% 0.19/0.50 % SZS output end IncompleteProof
%------------------------------------------------------------------------------