TSTP Solution File: GEO035-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO035-3 : TPTP v8.1.0. Released v1.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 : 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 : Sat Jul 16 04:58:29 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO035-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n025.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 23:18:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 v != extension(u,v,w,w)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 v != extension(u,v,w,w),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 X0 = X1 | ~equidistant(X0,X1,X2,X2)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 extension(u,v,w,w) = X1).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 ~equidistant(X0,X1,X2,X2),
% 0.12/0.34 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c5, plain,
% 0.12/0.34 X0 != X3 | v != X3,
% 0.12/0.34 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X0 = X3).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 v != X3,
% 0.12/0.34 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.12/0.34
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 v = X3).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 equidistant(X4,extension(X5,X4,X6,X7),X6,X7)).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 X0 = X4).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 X1 = extension(X5,X4,X6,X7)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 X2 = X6).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 X2 = X7).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c11, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, v),
% 0.12/0.34 bind(X1, extension(u,v,w,w)),
% 0.12/0.34 bind(X2, w),
% 0.12/0.34 bind(X3, v),
% 0.12/0.34 bind(X4, v),
% 0.12/0.34 bind(X5, u),
% 0.12/0.34 bind(X6, w),
% 0.12/0.34 bind(X7, w)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------