TSTP Solution File: GEO067-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO067-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:43 EDT 2022
% Result : Unsatisfiable 0.43s 1.01s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO067-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 08:01:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 12511 was started by sandbox on n016.cluster.edu,
% 0.43/1.01 Sat Jun 18 08:01:07 2022
% 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12358_n016.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_12358_n016.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (98 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01
% 0.43/1.01 ============================== end predicate elimination =============
% 0.43/1.01
% 0.43/1.01 Auto_denials: (non-Horn, no changes).
% 0.43/1.01
% 0.43/1.01 Term ordering decisions:
% 0.43/1.01 Function symbol KB weights: x=1. lower_dimension_point_1=1. lower_dimension_point_2=1. y=1. lower_dimension_point_3=1. z=1. reflection=1. extension=1. insertion=1. inner_pasch=1. euclid1=1. euclid2=1. continuous=1.
% 0.43/1.01
% 0.43/1.01 ============================== end of process initial clauses ========
% 0.43/1.01
% 0.43/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.01
% 0.43/1.01 ============================== end of clauses for search =============
% 0.43/1.01
% 0.43/1.01 ============================== SEARCH ================================
% 0.43/1.01
% 0.43/1.01 % Starting search at 0.01 seconds.
% 0.43/1.01
% 0.43/1.01 ============================== PROOF =================================
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01 % SZS output start Refutation
% 0.43/1.01
% 0.43/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.01 % Length of proof is 15.
% 0.43/1.01 % Level of proof is 4.
% 0.43/1.01 % Maximum clause weight is 16.000.
% 0.43/1.01 % Given clauses 25.
% 0.43/1.01
% 0.43/1.01 1 between(A,B,B) # label(t3) # label(axiom). [assumption].
% 0.43/1.01 2 between(A,A,B) # label(t2) # label(axiom). [assumption].
% 0.43/1.01 36 -colinear(x,x,y) | -colinear(x,y,x) | -colinear(y,x,x) | -colinear(x,z,y) # label(part_2) # label(negated_conjecture). [assumption].
% 0.43/1.01 39 -between(A,B,C) | colinear(A,B,C) # label(colinearity1) # label(axiom). [assumption].
% 0.43/1.01 40 -between(A,B,C) | colinear(C,A,B) # label(colinearity2) # label(axiom). [assumption].
% 0.43/1.01 79 -colinear(x,x,y) | -colinear(x,y,x) | -colinear(y,x,x) | x = y # label(part_1) # label(negated_conjecture). [assumption].
% 0.43/1.01 80 -colinear(x,x,y) | -colinear(x,y,x) | -colinear(y,x,x) | y = x. [copy(79),flip(d)].
% 0.43/1.01 166 colinear(A,A,B). [resolve(39,a,2,a)].
% 0.43/1.01 167 colinear(A,B,B). [resolve(39,a,1,a)].
% 0.43/1.01 168 -colinear(x,y,x) | y = x. [back_unit_del(80),unit_del(a,166),unit_del(c,167)].
% 0.43/1.01 169 -colinear(x,y,x) | -colinear(x,z,y). [back_unit_del(36),unit_del(a,166),unit_del(c,167)].
% 0.43/1.01 171 colinear(A,B,A). [resolve(40,a,1,a)].
% 0.43/1.01 172 -colinear(x,z,y). [back_unit_del(169),unit_del(a,171)].
% 0.43/1.01 173 y = x. [back_unit_del(168),unit_del(a,171)].
% 0.43/1.01 174 $F. [back_rewrite(172),rewrite([173(3)]),unit_del(a,171)].
% 0.43/1.01
% 0.43/1.01 % SZS output end Refutation
% 0.43/1.01 ============================== end of proof ==========================
% 0.43/1.01
% 0.43/1.01 ============================== STATISTICS ============================
% 0.43/1.01
% 0.43/1.01 Given=25. Generated=260. Kept=155. proofs=1.
% 0.43/1.01 Usable=24. Sos=119. Demods=8. Limbo=1, Disabled=109. Hints=0.
% 0.43/1.01 Megabytes=0.21.
% 0.43/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.01
% 0.43/1.01 ============================== end of statistics =====================
% 0.43/1.01
% 0.43/1.01 ============================== end of search =========================
% 0.43/1.01
% 0.43/1.01 THEOREM PROVED
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01
% 0.43/1.01 Exiting with 1 proof.
% 0.43/1.01
% 0.43/1.01 Process 12511 exit (max_proofs) Sat Jun 18 08:01:07 2022
% 0.43/1.01 Prover9 interrupted
%------------------------------------------------------------------------------