TSTP Solution File: GEO011-5 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO011-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 : 300s
% DateTime : Wed Jul 27 12:54:06 EDT 2022
% Result : Unsatisfiable 1.99s 2.18s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 5
% Syntax : Number of clauses : 6 ( 5 unt; 1 nHn; 6 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ colinear(A,B,C)
| between(A,B,C)
| between(B,C,A)
| between(C,A,B) ),
file('GEO011-5.p',unknown),
[] ).
cnf(11,axiom,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('GEO011-5.p',unknown),
[] ).
cnf(12,axiom,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
file('GEO011-5.p',unknown),
[] ).
cnf(13,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
file('GEO011-5.p',unknown),
[] ).
cnf(26,axiom,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('GEO011-5.p',unknown),
[] ).
cnf(27,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[26,4]),11,12,13]),
[iquote('hyper,26,4,unit_del,11,12,13')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO011-5 : TPTP v8.1.0. Released v1.0.0.
% 0.14/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 06:57:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.99/2.18 ----- Otter 3.3f, August 2004 -----
% 1.99/2.18 The process was started by sandbox2 on n020.cluster.edu,
% 1.99/2.18 Wed Jul 27 06:57:39 2022
% 1.99/2.18 The command was "./otter". The process ID is 9389.
% 1.99/2.18
% 1.99/2.18 set(prolog_style_variables).
% 1.99/2.18 set(auto).
% 1.99/2.18 dependent: set(auto1).
% 1.99/2.18 dependent: set(process_input).
% 1.99/2.18 dependent: clear(print_kept).
% 1.99/2.18 dependent: clear(print_new_demod).
% 1.99/2.18 dependent: clear(print_back_demod).
% 1.99/2.18 dependent: clear(print_back_sub).
% 1.99/2.18 dependent: set(control_memory).
% 1.99/2.18 dependent: assign(max_mem, 12000).
% 1.99/2.18 dependent: assign(pick_given_ratio, 4).
% 1.99/2.18 dependent: assign(stats_level, 1).
% 1.99/2.18 dependent: assign(max_seconds, 10800).
% 1.99/2.18 clear(print_given).
% 1.99/2.18
% 1.99/2.18 list(usable).
% 1.99/2.18 0 [] A=A.
% 1.99/2.18 0 [] -between(X,Y,Z)|colinear(X,Y,Z).
% 1.99/2.18 0 [] -between(Y,Z,X)|colinear(X,Y,Z).
% 1.99/2.18 0 [] -between(Z,X,Y)|colinear(X,Y,Z).
% 1.99/2.18 0 [] -colinear(X,Y,Z)|between(X,Y,Z)|between(Y,Z,X)|between(Z,X,Y).
% 1.99/2.18 0 [] e_qual_distance(distance(X,Y),distance(Y,X)).
% 1.99/2.18 0 [] -e_qual_distance(distance(X,Y),distance(Z,V))| -e_qual_distance(distance(X,Y),distance(V2,W))|e_qual_distance(distance(Z,V),distance(V2,W)).
% 1.99/2.18 0 [] -e_qual_distance(distance(X,Y),distance(Z,Z))|X=Y.
% 1.99/2.18 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.99/2.18 0 [] e_qual_distance(distance(Y,extension(X,Y,W,V)),distance(W,V)).
% 1.99/2.18 0 [] -e_qual_distance(distance(X,Y),distance(X1,Y1))| -e_qual_distance(distance(Y,Z),distance(Y1,Z1))| -e_qual_distance(distance(X,V),distance(X1,V1))| -e_qual_distance(distance(Y,V),distance(Y1,V1))| -between(X,Y,Z)| -between(X1,Y1,Z1)|X=Y|e_qual_distance(distance(Z,V),distance(Z1,V1)).
% 1.99/2.18 0 [] -between(X,Y,X)|X=Y.
% 1.99/2.18 0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.99/2.18 0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.99/2.18 0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.99/2.18 0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.99/2.18 0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.99/2.18 0 [] colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.99/2.18 end_of_list.
% 1.99/2.18
% 1.99/2.18 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.99/2.18
% 1.99/2.18 This ia a non-Horn set with equality. The strategy will be
% 1.99/2.18 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.99/2.18 deletion, with positive clauses in sos and nonpositive
% 1.99/2.18 clauses in usable.
% 1.99/2.18
% 1.99/2.18 dependent: set(knuth_bendix).
% 1.99/2.18 dependent: set(anl_eq).
% 1.99/2.18 dependent: set(para_from).
% 1.99/2.18 dependent: set(para_into).
% 1.99/2.18 dependent: clear(para_from_right).
% 1.99/2.18 dependent: clear(para_into_right).
% 1.99/2.18 dependent: set(para_from_vars).
% 1.99/2.18 dependent: set(eq_units_both_ways).
% 1.99/2.18 dependent: set(dynamic_demod_all).
% 1.99/2.18 dependent: set(dynamic_demod).
% 1.99/2.18 dependent: set(order_eq).
% 1.99/2.18 dependent: set(back_demod).
% 1.99/2.18 dependent: set(lrpo).
% 1.99/2.18 dependent: set(hyper_res).
% 1.99/2.18 dependent: set(unit_deletion).
% 1.99/2.18 dependent: set(factor).
% 1.99/2.18
% 1.99/2.18 ------------> process usable:
% 1.99/2.18 ** KEPT (pick-wt=8): 1 [] -between(A,B,C)|colinear(A,B,C).
% 1.99/2.18 ** KEPT (pick-wt=8): 2 [] -between(A,B,C)|colinear(C,A,B).
% 1.99/2.18 ** KEPT (pick-wt=8): 3 [] -between(A,B,C)|colinear(B,C,A).
% 1.99/2.18 ** KEPT (pick-wt=16): 4 [] -colinear(A,B,C)|between(A,B,C)|between(B,C,A)|between(C,A,B).
% 1.99/2.18 ** KEPT (pick-wt=21): 5 [] -e_qual_distance(distance(A,B),distance(C,D))| -e_qual_distance(distance(A,B),distance(E,F))|e_qual_distance(distance(C,D),distance(E,F)).
% 1.99/2.18 ** KEPT (pick-wt=10): 6 [] -e_qual_distance(distance(A,B),distance(C,C))|A=B.
% 1.99/2.18 ** KEPT (pick-wt=46): 7 [] -e_qual_distance(distance(A,B),distance(C,D))| -e_qual_distance(distance(B,E),distance(D,F))| -e_qual_distance(distance(A,G),distance(C,H))| -e_qual_distance(distance(B,G),distance(D,H))| -between(A,B,E)| -between(C,D,F)|A=B|e_qual_distance(distance(E,G),distance(F,H)).
% 1.99/2.18 ** KEPT (pick-wt=7): 8 [] -between(A,B,A)|A=B.
% 1.99/2.18 ** KEPT (pick-wt=17): 9 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.99/2.18 ** KEPT (pick-wt=17): 10 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.99/2.18 ** KEPT (pick-wt=4): 11 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.99/2.18 ** KEPT (pick-wt=4): 12 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.99/2.18 ** KEPT (pick-wt=4): 13 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.99/2.18
% 1.99/2.18 ------------> process sos:
% 1.99/2.18 ** KEPT (pick-wt=3): 22 [] A=A.
% 1.99/2.18 ** KEPT (pick-wt=7): 23 [] e_qual_distance(distance(A,B),distance(B,A)).
% 1.99/2.18 ** KEPT (pick-wt=8): 24 [] between(A,B,extension(A,B,C,D)).
% 1.99/2.18 ** KEPT (pick-wt=11): 25 [] e_qual_distance(distance(A,extension(B,A,C,D)),distance(C,D)).
% 1.99/2.18 ** KEPT (pick-wt=4): 26 [] colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.99/2.18 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] A=A.
% 1.99/2.18 23 back subsumes 21.
% 1.99/2.18
% 1.99/2.18 ======= end of input processing =======
% 1.99/2.18
% 1.99/2.18 =========== start of search ===========
% 1.99/2.18
% 1.99/2.18 -------- PROOF --------
% 1.99/2.18
% 1.99/2.18 -----> EMPTY CLAUSE at 0.00 sec ----> 27 [hyper,26,4,unit_del,11,12,13] $F.
% 1.99/2.18
% 1.99/2.18 Length of proof is 0. Level of proof is 0.
% 1.99/2.18
% 1.99/2.18 ---------------- PROOF ----------------
% 1.99/2.18 % SZS status Unsatisfiable
% 1.99/2.18 % SZS output start Refutation
% See solution above
% 1.99/2.18 ------------ end of proof -------------
% 1.99/2.18
% 1.99/2.18
% 1.99/2.18 Search stopped by max_proofs option.
% 1.99/2.18
% 1.99/2.18
% 1.99/2.18 Search stopped by max_proofs option.
% 1.99/2.18
% 1.99/2.18 ============ end of search ============
% 1.99/2.18
% 1.99/2.18 -------------- statistics -------------
% 1.99/2.18 clauses given 2
% 1.99/2.18 clauses generated 34
% 1.99/2.18 clauses kept 26
% 1.99/2.18 clauses forward subsumed 16
% 1.99/2.18 clauses back subsumed 1
% 1.99/2.18 Kbytes malloced 976
% 1.99/2.18
% 1.99/2.18 ----------- times (seconds) -----------
% 1.99/2.18 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.18 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.99/2.18
% 1.99/2.18 That finishes the proof of the theorem.
% 1.99/2.18
% 1.99/2.18 Process 9389 finished Wed Jul 27 06:57:40 2022
% 1.99/2.18 Otter interrupted
% 1.99/2.18 PROOF FOUND
%------------------------------------------------------------------------------