TSTP Solution File: GEO067-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO067-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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 05:53:42 EDT 2022
% Result : Unsatisfiable 0.65s 0.93s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO067-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sat Jun 18 15:57:23 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.65/0.93 ============================== Prover9 ===============================
% 0.65/0.93 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.93 Process 31261 was started by sandbox2 on n005.cluster.edu,
% 0.65/0.93 Sat Jun 18 15:57:24 2022
% 0.65/0.93 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30909_n005.cluster.edu".
% 0.65/0.93 ============================== end of head ===========================
% 0.65/0.93
% 0.65/0.93 ============================== INPUT =================================
% 0.65/0.93
% 0.65/0.93 % Reading from file /tmp/Prover9_30909_n005.cluster.edu
% 0.65/0.93
% 0.65/0.93 set(prolog_style_variables).
% 0.65/0.93 set(auto2).
% 0.65/0.93 % set(auto2) -> set(auto).
% 0.65/0.93 % set(auto) -> set(auto_inference).
% 0.65/0.93 % set(auto) -> set(auto_setup).
% 0.65/0.93 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.93 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.93 % set(auto) -> set(auto_limits).
% 0.65/0.93 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.93 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.93 % set(auto) -> set(auto_denials).
% 0.65/0.93 % set(auto) -> set(auto_process).
% 0.65/0.93 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.93 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.93 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.93 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.93 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.93 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.93 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.93 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.93 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.93 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.93 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.93 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.93 % set(auto2) -> assign(stats, some).
% 0.65/0.93 % set(auto2) -> clear(echo_input).
% 0.65/0.93 % set(auto2) -> set(quiet).
% 0.65/0.93 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.93 % set(auto2) -> clear(print_given).
% 0.65/0.93 assign(lrs_ticks,-1).
% 0.65/0.93 assign(sos_limit,10000).
% 0.65/0.93 assign(order,kbo).
% 0.65/0.93 set(lex_order_vars).
% 0.65/0.93 clear(print_given).
% 0.65/0.93
% 0.65/0.93 % formulas(sos). % not echoed (24 formulas)
% 0.65/0.93
% 0.65/0.93 ============================== end of input ==========================
% 0.65/0.93
% 0.65/0.93 % From the command line: assign(max_seconds, 300).
% 0.65/0.93
% 0.65/0.93 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.93
% 0.65/0.93 % Formulas that are not ordinary clauses:
% 0.65/0.93
% 0.65/0.93 ============================== end of process non-clausal formulas ===
% 0.65/0.93
% 0.65/0.93 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.93
% 0.65/0.93 ============================== PREDICATE ELIMINATION =================
% 0.65/0.93
% 0.65/0.93 ============================== end predicate elimination =============
% 0.65/0.93
% 0.65/0.93 Auto_denials: (non-Horn, no changes).
% 0.65/0.93
% 0.65/0.93 Term ordering decisions:
% 0.65/0.93 Function symbol KB weights: x=1. y=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. z=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 0.65/0.93
% 0.65/0.93 ============================== end of process initial clauses ========
% 0.65/0.93
% 0.65/0.93 ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.93
% 0.65/0.93 ============================== end of clauses for search =============
% 0.65/0.93
% 0.65/0.93 ============================== SEARCH ================================
% 0.65/0.93
% 0.65/0.93 % Starting search at 0.01 seconds.
% 0.65/0.93
% 0.65/0.93 ============================== PROOF =================================
% 0.65/0.93 % SZS status Unsatisfiable
% 0.65/0.93 % SZS output start Refutation
% 0.65/0.93
% 0.65/0.93 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.65/0.93 % Length of proof is 16.
% 0.65/0.93 % Level of proof is 5.
% 0.65/0.93 % Maximum clause weight is 16.000.
% 0.65/0.93 % Given clauses 45.
% 0.65/0.93
% 0.65/0.93 2 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 0.65/0.93 3 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 0.65/0.93 7 -colinear(x,x,y) | -colinear(x,y,x) | -colinear(y,x,x) | -colinear(x,z,y) # label(part_2) # label(negated_conjecture). [assumption].
% 0.65/0.93 9 -equidistant(A,B,C,C) | A = B # label(identity_for_equidistance) # label(axiom). [assumption].
% 0.65/0.93 10 -between(A,B,C) | colinear(A,B,C) # label(colinearity1) # label(axiom). [assumption].
% 0.65/0.93 11 -between(A,B,C) | colinear(C,A,B) # label(colinearity2) # label(axiom). [assumption].
% 0.65/0.93 12 -between(A,B,C) | colinear(B,C,A) # label(colinearity3) # label(axiom). [assumption].
% 0.65/0.93 14 -colinear(x,x,y) | -colinear(x,y,x) | -colinear(y,x,x) | x = y # label(part_1) # label(negated_conjecture). [assumption].
% 0.65/0.93 15 -colinear(x,x,y) | -colinear(x,y,x) | -colinear(y,x,x) | y = x. [copy(14),flip(d)].
% 0.65/0.93 44 extension(A,B,C,C) = B. [resolve(9,a,3,a),flip(a)].
% 0.65/0.93 118 between(A,B,B). [para(44(a,1),2(a,3))].
% 0.65/0.93 150 colinear(A,A,B). [resolve(118,a,12,a)].
% 0.65/0.93 151 colinear(A,B,A). [resolve(118,a,11,a)].
% 0.65/0.93 152 colinear(A,B,B). [resolve(118,a,10,a)].
% 0.65/0.93 153 y = x. [back_unit_del(15),unit_del(a,150),unit_del(b,151),unit_del(c,152)].
% 0.65/0.93 154 $F. [back_unit_del(7),rewrite([153(3),153(6),153(9),153(15)]),merge(b),merge(c),unit_del(a,150),unit_del(b,151)].
% 0.65/0.93
% 0.65/0.93 % SZS output end Refutation
% 0.65/0.93 ============================== end of proof ==========================
% 0.65/0.93
% 0.65/0.93 ============================== STATISTICS ============================
% 0.65/0.93
% 0.65/0.93 Given=45. Generated=268. Kept=152. proofs=1.
% 0.65/0.93 Usable=33. Sos=77. Demods=2. Limbo=4, Disabled=62. Hints=0.
% 0.65/0.93 Megabytes=0.17.
% 0.65/0.93 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.65/0.93
% 0.65/0.93 ============================== end of statistics =====================
% 0.65/0.93
% 0.65/0.93 ============================== end of search =========================
% 0.65/0.93
% 0.65/0.93 THEOREM PROVED
% 0.65/0.93 % SZS status Unsatisfiable
% 0.65/0.93
% 0.65/0.93 Exiting with 1 proof.
% 0.65/0.93
% 0.65/0.93 Process 31261 exit (max_proofs) Sat Jun 18 15:57:24 2022
% 0.65/0.93 Prover9 interrupted
%------------------------------------------------------------------------------