TSTP Solution File: GEO015-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO015-2 : 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 : 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 04:58:20 EDT 2022
% Result : Unsatisfiable 0.19s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO015-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n022.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 : Fri Jun 17 18:53:17 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.34 % SZS status Unsatisfiable
% 0.19/0.34 % SZS output begin IncompleteProof
% 0.19/0.34 cnf(c0, axiom,
% 0.19/0.34 ~equidistant(w,x,u,v)).
% 0.19/0.34 cnf(c1, plain,
% 0.19/0.34 ~equidistant(w,x,u,v),
% 0.19/0.34 inference(start, [], [c0])).
% 0.19/0.34
% 0.19/0.34 cnf(c2, axiom,
% 0.19/0.34 equidistant(X0,X1,X2,X3) | ~equidistant(X4,X5,X2,X3) | ~equidistant(X4,X5,X0,X1)).
% 0.19/0.34 cnf(a0, assumption,
% 0.19/0.34 w = X0).
% 0.19/0.34 cnf(a1, assumption,
% 0.19/0.34 x = X1).
% 0.19/0.34 cnf(a2, assumption,
% 0.19/0.34 u = X2).
% 0.19/0.34 cnf(a3, assumption,
% 0.19/0.34 v = X3).
% 0.19/0.34 cnf(c3, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.19/0.34 cnf(c4, plain,
% 0.19/0.34 ~equidistant(X4,X5,X2,X3) | ~equidistant(X4,X5,X0,X1),
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.19/0.34
% 0.19/0.34 cnf(c5, axiom,
% 0.19/0.34 equidistant(X6,X7,X7,X6)).
% 0.19/0.34 cnf(a4, assumption,
% 0.19/0.34 X4 = X6).
% 0.19/0.34 cnf(a5, assumption,
% 0.19/0.34 X5 = X7).
% 0.19/0.34 cnf(a6, assumption,
% 0.19/0.34 X2 = X7).
% 0.19/0.34 cnf(a7, assumption,
% 0.19/0.34 X3 = X6).
% 0.19/0.34 cnf(c6, plain,
% 0.19/0.34 ~equidistant(X4,X5,X0,X1),
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7])], [c4, c5])).
% 0.19/0.34 cnf(c7, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7])], [c4, c5])).
% 0.19/0.34
% 0.19/0.34 cnf(c8, axiom,
% 0.19/0.34 equidistant(X8,X9,X10,X11) | ~equidistant(X12,X13,X10,X11) | ~equidistant(X12,X13,X8,X9)).
% 0.19/0.34 cnf(a8, assumption,
% 0.19/0.34 X4 = X8).
% 0.19/0.34 cnf(a9, assumption,
% 0.19/0.34 X5 = X9).
% 0.19/0.34 cnf(a10, assumption,
% 0.19/0.34 X0 = X10).
% 0.19/0.34 cnf(a11, assumption,
% 0.19/0.34 X1 = X11).
% 0.19/0.34 cnf(c9, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10, a11])], [c6, c8])).
% 0.19/0.34 cnf(c10, plain,
% 0.19/0.34 ~equidistant(X12,X13,X10,X11) | ~equidistant(X12,X13,X8,X9),
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10, a11])], [c6, c8])).
% 0.19/0.34
% 0.19/0.34 cnf(c11, axiom,
% 0.19/0.34 equidistant(u,v,w,x)).
% 0.19/0.34 cnf(a12, assumption,
% 0.19/0.34 X12 = u).
% 0.19/0.34 cnf(a13, assumption,
% 0.19/0.34 X13 = v).
% 0.19/0.34 cnf(a14, assumption,
% 0.19/0.34 X10 = w).
% 0.19/0.34 cnf(a15, assumption,
% 0.19/0.34 X11 = x).
% 0.19/0.34 cnf(c12, plain,
% 0.19/0.34 ~equidistant(X12,X13,X8,X9),
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14, a15])], [c10, c11])).
% 0.19/0.34 cnf(c13, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14, a15])], [c10, c11])).
% 0.19/0.34
% 0.19/0.34 cnf(c14, axiom,
% 0.19/0.34 equidistant(X14,X15,X15,X14)).
% 0.19/0.34 cnf(a16, assumption,
% 0.19/0.34 X12 = X14).
% 0.19/0.34 cnf(a17, assumption,
% 0.19/0.34 X13 = X15).
% 0.19/0.34 cnf(a18, assumption,
% 0.19/0.34 X8 = X15).
% 0.19/0.34 cnf(a19, assumption,
% 0.19/0.34 X9 = X14).
% 0.19/0.34 cnf(c15, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a16, a17, a18, a19])], [c12, c14])).
% 0.19/0.34 cnf(c16, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(strict_predicate_extension, [assumptions([a16, a17, a18, a19])], [c12, c14])).
% 0.19/0.34
% 0.19/0.34 cnf(c17, plain,
% 0.19/0.34 $false,
% 0.19/0.34 inference(constraint_solving, [
% 0.19/0.34 bind(X0, w),
% 0.19/0.34 bind(X1, x),
% 0.19/0.34 bind(X2, u),
% 0.19/0.34 bind(X3, v),
% 0.19/0.34 bind(X4, v),
% 0.19/0.34 bind(X5, u),
% 0.19/0.34 bind(X6, v),
% 0.19/0.34 bind(X7, u),
% 0.19/0.34 bind(X8, v),
% 0.19/0.34 bind(X9, u),
% 0.19/0.34 bind(X10, w),
% 0.19/0.34 bind(X11, x),
% 0.19/0.34 bind(X12, u),
% 0.19/0.34 bind(X13, v),
% 0.19/0.34 bind(X14, u),
% 0.19/0.34 bind(X15, v)
% 0.19/0.34 ],
% 0.19/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 0.19/0.34
% 0.19/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------