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