TSTP Solution File: GEO015-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO015-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 : n014.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:20 EDT 2022
% Result : Unsatisfiable 0.15s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GEO015-3 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.37 % Computer : n014.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Sat Jun 18 01:39:19 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.15/0.38 % SZS status Unsatisfiable
% 0.15/0.38 % SZS output begin IncompleteProof
% 0.15/0.38 cnf(c0, axiom,
% 0.15/0.38 ~equidistant(w,x,u,v)).
% 0.15/0.38 cnf(c1, plain,
% 0.15/0.38 ~equidistant(w,x,u,v),
% 0.15/0.38 inference(start, [], [c0])).
% 0.15/0.38
% 0.15/0.38 cnf(c2, axiom,
% 0.15/0.38 equidistant(X0,X1,X2,X3) | ~equidistant(X4,X5,X2,X3) | ~equidistant(X4,X5,X0,X1)).
% 0.15/0.38 cnf(a0, assumption,
% 0.15/0.38 w = X0).
% 0.15/0.38 cnf(a1, assumption,
% 0.15/0.38 x = X1).
% 0.15/0.38 cnf(a2, assumption,
% 0.15/0.38 u = X2).
% 0.15/0.38 cnf(a3, assumption,
% 0.15/0.38 v = X3).
% 0.15/0.38 cnf(c3, plain,
% 0.15/0.38 $false,
% 0.15/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.15/0.38 cnf(c4, plain,
% 0.15/0.38 ~equidistant(X4,X5,X2,X3) | ~equidistant(X4,X5,X0,X1),
% 0.15/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.15/0.38
% 0.15/0.38 cnf(c5, axiom,
% 0.15/0.38 equidistant(X6,X7,X6,X7)).
% 0.15/0.38 cnf(a4, assumption,
% 0.15/0.38 X4 = X6).
% 0.15/0.38 cnf(a5, assumption,
% 0.15/0.38 X5 = X7).
% 0.15/0.38 cnf(a6, assumption,
% 0.15/0.38 X2 = X6).
% 0.15/0.38 cnf(a7, assumption,
% 0.15/0.38 X3 = X7).
% 0.15/0.38 cnf(c6, plain,
% 0.15/0.38 ~equidistant(X4,X5,X0,X1),
% 0.15/0.38 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7])], [c4, c5])).
% 0.15/0.38 cnf(c7, plain,
% 0.15/0.38 $false,
% 0.15/0.38 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7])], [c4, c5])).
% 0.15/0.38
% 0.15/0.38 cnf(c8, axiom,
% 0.15/0.38 equidistant(u,v,w,x)).
% 0.15/0.38 cnf(a8, assumption,
% 0.15/0.38 X4 = u).
% 0.15/0.38 cnf(a9, assumption,
% 0.15/0.38 X5 = v).
% 0.15/0.38 cnf(a10, assumption,
% 0.15/0.38 X0 = w).
% 0.15/0.38 cnf(a11, assumption,
% 0.15/0.38 X1 = x).
% 0.15/0.38 cnf(c9, plain,
% 0.15/0.38 $false,
% 0.15/0.38 inference(strict_predicate_extension, [assumptions([a8, a9, a10, a11])], [c6, c8])).
% 0.15/0.38 cnf(c10, plain,
% 0.15/0.38 $false,
% 0.15/0.38 inference(strict_predicate_extension, [assumptions([a8, a9, a10, a11])], [c6, c8])).
% 0.15/0.38
% 0.15/0.38 cnf(c11, plain,
% 0.15/0.38 $false,
% 0.15/0.38 inference(constraint_solving, [
% 0.15/0.38 bind(X0, w),
% 0.15/0.38 bind(X1, x),
% 0.15/0.38 bind(X2, u),
% 0.15/0.38 bind(X3, v),
% 0.15/0.38 bind(X4, u),
% 0.15/0.38 bind(X5, v),
% 0.15/0.38 bind(X6, u),
% 0.15/0.38 bind(X7, v)
% 0.15/0.38 ],
% 0.15/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.15/0.38
% 0.15/0.38 % SZS output end IncompleteProof
%------------------------------------------------------------------------------