TSTP Solution File: GEO001-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO001-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:04 EDT 2022
% Result : Unsatisfiable 3.22s 3.55s
% Output : Refutation 3.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO001-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 07:12:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 3.22/3.55 ============================== Prover9 ===============================
% 3.22/3.55 Prover9 (32) version 2009-11A, November 2009.
% 3.22/3.55 Process 16498 was started by sandbox2 on n004.cluster.edu,
% 3.22/3.55 Sat Jun 18 07:12:54 2022
% 3.22/3.55 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16345_n004.cluster.edu".
% 3.22/3.55 ============================== end of head ===========================
% 3.22/3.55
% 3.22/3.55 ============================== INPUT =================================
% 3.22/3.55
% 3.22/3.55 % Reading from file /tmp/Prover9_16345_n004.cluster.edu
% 3.22/3.55
% 3.22/3.55 set(prolog_style_variables).
% 3.22/3.55 set(auto2).
% 3.22/3.55 % set(auto2) -> set(auto).
% 3.22/3.55 % set(auto) -> set(auto_inference).
% 3.22/3.55 % set(auto) -> set(auto_setup).
% 3.22/3.55 % set(auto_setup) -> set(predicate_elim).
% 3.22/3.55 % set(auto_setup) -> assign(eq_defs, unfold).
% 3.22/3.55 % set(auto) -> set(auto_limits).
% 3.22/3.55 % set(auto_limits) -> assign(max_weight, "100.000").
% 3.22/3.55 % set(auto_limits) -> assign(sos_limit, 20000).
% 3.22/3.55 % set(auto) -> set(auto_denials).
% 3.22/3.55 % set(auto) -> set(auto_process).
% 3.22/3.55 % set(auto2) -> assign(new_constants, 1).
% 3.22/3.55 % set(auto2) -> assign(fold_denial_max, 3).
% 3.22/3.55 % set(auto2) -> assign(max_weight, "200.000").
% 3.22/3.55 % set(auto2) -> assign(max_hours, 1).
% 3.22/3.55 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 3.22/3.55 % set(auto2) -> assign(max_seconds, 0).
% 3.22/3.55 % set(auto2) -> assign(max_minutes, 5).
% 3.22/3.55 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 3.22/3.55 % set(auto2) -> set(sort_initial_sos).
% 3.22/3.55 % set(auto2) -> assign(sos_limit, -1).
% 3.22/3.55 % set(auto2) -> assign(lrs_ticks, 3000).
% 3.22/3.55 % set(auto2) -> assign(max_megs, 400).
% 3.22/3.55 % set(auto2) -> assign(stats, some).
% 3.22/3.55 % set(auto2) -> clear(echo_input).
% 3.22/3.55 % set(auto2) -> set(quiet).
% 3.22/3.55 % set(auto2) -> clear(print_initial_clauses).
% 3.22/3.55 % set(auto2) -> clear(print_given).
% 3.22/3.55 assign(lrs_ticks,-1).
% 3.22/3.55 assign(sos_limit,10000).
% 3.22/3.55 assign(order,kbo).
% 3.22/3.55 set(lex_order_vars).
% 3.22/3.55 clear(print_given).
% 3.22/3.55
% 3.22/3.55 % formulas(sos). % not echoed (47 formulas)
% 3.22/3.55
% 3.22/3.55 ============================== end of input ==========================
% 3.22/3.55
% 3.22/3.55 % From the command line: assign(max_seconds, 300).
% 3.22/3.55
% 3.22/3.55 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 3.22/3.55
% 3.22/3.55 % Formulas that are not ordinary clauses:
% 3.22/3.55
% 3.22/3.55 ============================== end of process non-clausal formulas ===
% 3.22/3.55
% 3.22/3.55 ============================== PROCESS INITIAL CLAUSES ===============
% 3.22/3.55
% 3.22/3.55 ============================== PREDICATE ELIMINATION =================
% 3.22/3.55
% 3.22/3.55 ============================== end predicate elimination =============
% 3.22/3.55
% 3.22/3.55 Auto_denials: (non-Horn, no changes).
% 3.22/3.55
% 3.22/3.55 Term ordering decisions:
% 3.22/3.55 Function symbol KB weights: a=1. b=1. c=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.
% 3.22/3.55
% 3.22/3.55 ============================== end of process initial clauses ========
% 3.22/3.55
% 3.22/3.55 ============================== CLAUSES FOR SEARCH ====================
% 3.22/3.55
% 3.22/3.55 ============================== end of clauses for search =============
% 3.22/3.55
% 3.22/3.55 ============================== SEARCH ================================
% 3.22/3.55
% 3.22/3.55 % Starting search at 0.02 seconds.
% 3.22/3.55
% 3.22/3.55 ============================== PROOF =================================
% 3.22/3.55 % SZS status Unsatisfiable
% 3.22/3.55 % SZS output start Refutation
% 3.22/3.55
% 3.22/3.55 % Proof 1 at 2.58 (+ 0.01) seconds.
% 3.22/3.55 % Length of proof is 12.
% 3.22/3.55 % Level of proof is 4.
% 3.22/3.55 % Maximum clause weight is 17.000.
% 3.22/3.55 % Given clauses 144.
% 3.22/3.55
% 3.22/3.55 1 between(A,B,B) # label(t3) # label(axiom). [assumption].
% 3.22/3.55 2 between(a,b,c) # label(b_between_a_and_c) # label(hypothesis). [assumption].
% 3.22/3.55 24 -between(c,b,a) # label(prove_b_between_c_and_a) # label(negated_conjecture). [assumption].
% 3.22/3.55 25 -between(A,B,A) | A = B # label(identity_for_betweeness) # label(axiom). [assumption].
% 3.22/3.55 45 -between(A,B,C) | -between(D,E,C) | between(B,inner_pasch(A,B,C,E,D),D) # label(inner_pasch1) # label(axiom). [assumption].
% 3.22/3.55 46 -between(A,B,C) | -between(D,E,C) | between(E,inner_pasch(A,B,C,E,D),A) # label(inner_pasch2) # label(axiom). [assumption].
% 3.22/3.55 102 -between(A,B,c) | between(b,inner_pasch(a,b,c,B,A),A). [resolve(45,a,2,a)].
% 3.22/3.55 108 -between(A,B,c) | between(B,inner_pasch(a,b,c,B,A),a). [resolve(46,a,2,a)].
% 3.22/3.55 586 between(b,inner_pasch(a,b,c,c,A),A). [resolve(102,a,1,a)].
% 3.22/3.55 612 inner_pasch(a,b,c,c,b) = b. [resolve(586,a,25,a),flip(a)].
% 3.22/3.55 735 between(c,inner_pasch(a,b,c,c,A),a). [resolve(108,a,1,a)].
% 3.22/3.55 753 $F. [para(612(a,1),735(a,2)),unit_del(a,24)].
% 3.22/3.55
% 3.22/3.55 % SZS output end Refutation
% 3.22/3.55 ============================== end of proof ==========================
% 3.22/3.55
% 3.22/3.55 ============================== STATISTICS ============================
% 3.22/3.55
% 3.22/3.55 Given=144. Generated=2408. Kept=743. proofs=1.
% 3.22/3.55 Usable=138. Sos=517. Demods=8. Limbo=17, Disabled=118. Hints=0.
% 3.22/3.55 Megabytes=0.77.
% 3.22/3.55 User_CPU=2.58, System_CPU=0.01, Wall_clock=3.
% 3.22/3.55
% 3.22/3.55 ============================== end of statistics =====================
% 3.22/3.55
% 3.22/3.55 ============================== end of search =========================
% 3.22/3.55
% 3.22/3.55 THEOREM PROVED
% 3.22/3.55 % SZS status Unsatisfiable
% 3.22/3.55
% 3.22/3.55 Exiting with 1 proof.
% 3.22/3.55
% 3.22/3.55 Process 16498 exit (max_proofs) Sat Jun 18 07:12:57 2022
% 3.22/3.55 Prover9 interrupted
%------------------------------------------------------------------------------