TSTP Solution File: GEO006-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO006-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:08 EDT 2022
% Result : Unsatisfiable 0.45s 1.03s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO006-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 14:38:13 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 28237 was started by sandbox2 on n003.cluster.edu,
% 0.45/1.03 Sat Jun 18 14:38:13 2022
% 0.45/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28084_n003.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_28084_n003.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (54 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03
% 0.45/1.03 ============================== end predicate elimination =============
% 0.45/1.03
% 0.45/1.03 Auto_denials: (non-Horn, no changes).
% 0.45/1.03
% 0.45/1.03 Term ordering decisions:
% 0.45/1.03 Function symbol KB weights: a=1. c=1. d=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. reflection=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 0.45/1.03
% 0.45/1.03 ============================== end of process initial clauses ========
% 0.45/1.03
% 0.45/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.03
% 0.45/1.03 ============================== end of clauses for search =============
% 0.45/1.03
% 0.45/1.03 ============================== SEARCH ================================
% 0.45/1.03
% 0.45/1.03 % Starting search at 0.02 seconds.
% 0.45/1.03
% 0.45/1.03 ============================== PROOF =================================
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03 % SZS output start Refutation
% 0.45/1.03
% 0.45/1.03 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.45/1.03 % Length of proof is 10.
% 0.45/1.03 % Level of proof is 3.
% 0.45/1.03 % Maximum clause weight is 11.000.
% 0.45/1.03 % Given clauses 34.
% 0.45/1.03
% 0.45/1.03 3 between(a,c,d) # label(c_between_a_and_d) # label(hypothesis). [assumption].
% 0.45/1.03 16 between(c,a,d) | between(a,d,c) # label(prove_not_between_others) # label(negated_conjecture). [assumption].
% 0.45/1.03 23 a != c # label(a_not_c) # label(hypothesis). [assumption].
% 0.45/1.03 24 c != a. [copy(23),flip(a)].
% 0.45/1.03 27 c != d # label(c_not_d) # label(hypothesis). [assumption].
% 0.45/1.03 28 d != c. [copy(27),flip(a)].
% 0.45/1.03 49 -between(A,B,C) | -between(B,A,C) | A = B # label(b2) # label(axiom). [assumption].
% 0.45/1.03 50 -between(A,B,C) | -between(A,C,B) | B = C # label(b3) # label(axiom). [assumption].
% 0.45/1.03 125 between(a,d,c). [resolve(49,a,16,a),unit_del(a,3),unit_del(b,24)].
% 0.45/1.03 137 $F. [resolve(50,a,3,a),flip(b),unit_del(a,125),unit_del(b,28)].
% 0.45/1.03
% 0.45/1.03 % SZS output end Refutation
% 0.45/1.03 ============================== end of proof ==========================
% 0.45/1.03
% 0.45/1.03 ============================== STATISTICS ============================
% 0.45/1.03
% 0.45/1.03 Given=34. Generated=244. Kept=124. proofs=1.
% 0.45/1.03 Usable=33. Sos=81. Demods=3. Limbo=1, Disabled=63. Hints=0.
% 0.45/1.03 Megabytes=0.14.
% 0.45/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=1.
% 0.45/1.03
% 0.45/1.03 ============================== end of statistics =====================
% 0.45/1.03
% 0.45/1.03 ============================== end of search =========================
% 0.45/1.03
% 0.45/1.03 THEOREM PROVED
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03
% 0.45/1.03 Exiting with 1 proof.
% 0.45/1.03
% 0.45/1.03 Process 28237 exit (max_proofs) Sat Jun 18 14:38:14 2022
% 0.45/1.03 Prover9 interrupted
%------------------------------------------------------------------------------