TSTP Solution File: GEO040-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO040-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:28 EDT 2022
% Result : Unsatisfiable 1.41s 1.73s
% Output : Refutation 1.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO040-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 19:34:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.41/1.73 ============================== Prover9 ===============================
% 1.41/1.73 Prover9 (32) version 2009-11A, November 2009.
% 1.41/1.73 Process 28615 was started by sandbox on n012.cluster.edu,
% 1.41/1.73 Fri Jun 17 19:34:09 2022
% 1.41/1.73 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28274_n012.cluster.edu".
% 1.41/1.73 ============================== end of head ===========================
% 1.41/1.73
% 1.41/1.73 ============================== INPUT =================================
% 1.41/1.73
% 1.41/1.73 % Reading from file /tmp/Prover9_28274_n012.cluster.edu
% 1.41/1.73
% 1.41/1.73 set(prolog_style_variables).
% 1.41/1.73 set(auto2).
% 1.41/1.73 % set(auto2) -> set(auto).
% 1.41/1.73 % set(auto) -> set(auto_inference).
% 1.41/1.73 % set(auto) -> set(auto_setup).
% 1.41/1.73 % set(auto_setup) -> set(predicate_elim).
% 1.41/1.73 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.41/1.73 % set(auto) -> set(auto_limits).
% 1.41/1.73 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.41/1.73 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.41/1.73 % set(auto) -> set(auto_denials).
% 1.41/1.73 % set(auto) -> set(auto_process).
% 1.41/1.73 % set(auto2) -> assign(new_constants, 1).
% 1.41/1.73 % set(auto2) -> assign(fold_denial_max, 3).
% 1.41/1.73 % set(auto2) -> assign(max_weight, "200.000").
% 1.41/1.73 % set(auto2) -> assign(max_hours, 1).
% 1.41/1.73 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.41/1.73 % set(auto2) -> assign(max_seconds, 0).
% 1.41/1.73 % set(auto2) -> assign(max_minutes, 5).
% 1.41/1.73 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.41/1.73 % set(auto2) -> set(sort_initial_sos).
% 1.41/1.73 % set(auto2) -> assign(sos_limit, -1).
% 1.41/1.73 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.41/1.73 % set(auto2) -> assign(max_megs, 400).
% 1.41/1.73 % set(auto2) -> assign(stats, some).
% 1.41/1.73 % set(auto2) -> clear(echo_input).
% 1.41/1.73 % set(auto2) -> set(quiet).
% 1.41/1.73 % set(auto2) -> clear(print_initial_clauses).
% 1.41/1.73 % set(auto2) -> clear(print_given).
% 1.41/1.73 assign(lrs_ticks,-1).
% 1.41/1.73 assign(sos_limit,10000).
% 1.41/1.73 assign(order,kbo).
% 1.41/1.73 set(lex_order_vars).
% 1.41/1.73 clear(print_given).
% 1.41/1.73
% 1.41/1.73 % formulas(sos). % not echoed (21 formulas)
% 1.41/1.73
% 1.41/1.73 ============================== end of input ==========================
% 1.41/1.73
% 1.41/1.73 % From the command line: assign(max_seconds, 300).
% 1.41/1.73
% 1.41/1.73 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.41/1.73
% 1.41/1.73 % Formulas that are not ordinary clauses:
% 1.41/1.73
% 1.41/1.73 ============================== end of process non-clausal formulas ===
% 1.41/1.73
% 1.41/1.73 ============================== PROCESS INITIAL CLAUSES ===============
% 1.41/1.73
% 1.41/1.73 ============================== PREDICATE ELIMINATION =================
% 1.41/1.73
% 1.41/1.73 ============================== end predicate elimination =============
% 1.41/1.73
% 1.41/1.73 Auto_denials: (non-Horn, no changes).
% 1.41/1.73
% 1.41/1.73 Term ordering decisions:
% 1.41/1.73 Function symbol KB weights: u=1. v=1. w=1. lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. extension=1. euclid1=1. euclid2=1. inner_pasch=1. continuous=1.
% 1.41/1.73
% 1.41/1.73 ============================== end of process initial clauses ========
% 1.41/1.73
% 1.41/1.73 ============================== CLAUSES FOR SEARCH ====================
% 1.41/1.73
% 1.41/1.73 ============================== end of clauses for search =============
% 1.41/1.73
% 1.41/1.73 ============================== SEARCH ================================
% 1.41/1.73
% 1.41/1.73 % Starting search at 0.01 seconds.
% 1.41/1.73
% 1.41/1.73 ============================== PROOF =================================
% 1.41/1.73 % SZS status Unsatisfiable
% 1.41/1.73 % SZS output start Refutation
% 1.41/1.73
% 1.41/1.73 % Proof 1 at 0.74 (+ 0.00) seconds.
% 1.41/1.73 % Length of proof is 13.
% 1.41/1.73 % Level of proof is 4.
% 1.41/1.73 % Maximum clause weight is 17.000.
% 1.41/1.73 % Given clauses 124.
% 1.41/1.73
% 1.41/1.73 1 between(u,v,w) # label(v_between_u_and_w) # label(hypothesis). [assumption].
% 1.41/1.73 2 between(v,u,w) # label(u_between_v_and_w) # label(hypothesis). [assumption].
% 1.41/1.73 6 u != v # label(prove_u_is_v) # label(negated_conjecture). [assumption].
% 1.41/1.73 7 v != u. [copy(6),flip(a)].
% 1.41/1.73 11 -between(A,B,A) | A = B # label(identity_for_betweeness) # label(axiom). [assumption].
% 1.41/1.73 14 -between(A,B,C) | -between(D,E,C) | between(B,inner_pasch(A,B,C,E,D),D) # label(inner_pasch1) # label(axiom). [assumption].
% 1.41/1.73 15 -between(A,B,C) | -between(D,E,C) | between(E,inner_pasch(A,B,C,E,D),A) # label(inner_pasch2) # label(axiom). [assumption].
% 1.41/1.73 40 -between(v,u,v). [ur(11,b,7,a)].
% 1.41/1.73 50 -between(A,B,w) | between(u,inner_pasch(v,u,w,B,A),A). [resolve(14,a,2,a)].
% 1.41/1.73 56 -between(A,B,w) | between(B,inner_pasch(v,u,w,B,A),v). [resolve(15,a,2,a)].
% 1.41/1.73 432 between(u,inner_pasch(v,u,w,v,u),u). [resolve(50,a,1,a)].
% 1.41/1.73 464 inner_pasch(v,u,w,v,u) = u. [resolve(432,a,11,a),flip(a)].
% 1.41/1.73 606 $F. [resolve(56,a,1,a),rewrite([464(7)]),unit_del(a,40)].
% 1.41/1.73
% 1.41/1.73 % SZS output end Refutation
% 1.41/1.73 ============================== end of proof ==========================
% 1.41/1.73
% 1.41/1.73 ============================== STATISTICS ============================
% 1.41/1.73
% 1.41/1.73 Given=124. Generated=2250. Kept=604. proofs=1.
% 1.41/1.73 Usable=112. Sos=392. Demods=7. Limbo=4, Disabled=117. Hints=0.
% 1.41/1.73 Megabytes=0.68.
% 1.41/1.73 User_CPU=0.74, System_CPU=0.00, Wall_clock=1.
% 1.41/1.73
% 1.41/1.73 ============================== end of statistics =====================
% 1.41/1.73
% 1.41/1.73 ============================== end of search =========================
% 1.41/1.73
% 1.41/1.73 THEOREM PROVED
% 1.41/1.73 % SZS status Unsatisfiable
% 1.41/1.73
% 1.41/1.73 Exiting with 1 proof.
% 1.41/1.73
% 1.41/1.73 Process 28615 exit (max_proofs) Fri Jun 17 19:34:10 2022
% 1.41/1.73 Prover9 interrupted
%------------------------------------------------------------------------------