TSTP Solution File: GEO002-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO002-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:05 EDT 2022
% Result : Unsatisfiable 0.68s 0.99s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO002-4 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 09:21:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.68/0.99 ============================== Prover9 ===============================
% 0.68/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.99 Process 11828 was started by sandbox on n027.cluster.edu,
% 0.68/0.99 Sat Jun 18 09:21:08 2022
% 0.68/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11469_n027.cluster.edu".
% 0.68/0.99 ============================== end of head ===========================
% 0.68/0.99
% 0.68/0.99 ============================== INPUT =================================
% 0.68/0.99
% 0.68/0.99 % Reading from file /tmp/Prover9_11469_n027.cluster.edu
% 0.68/0.99
% 0.68/0.99 set(prolog_style_variables).
% 0.68/0.99 set(auto2).
% 0.68/0.99 % set(auto2) -> set(auto).
% 0.68/0.99 % set(auto) -> set(auto_inference).
% 0.68/0.99 % set(auto) -> set(auto_setup).
% 0.68/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.99 % set(auto) -> set(auto_limits).
% 0.68/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.99 % set(auto) -> set(auto_denials).
% 0.68/0.99 % set(auto) -> set(auto_process).
% 0.68/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.99 % set(auto2) -> assign(stats, some).
% 0.68/0.99 % set(auto2) -> clear(echo_input).
% 0.68/0.99 % set(auto2) -> set(quiet).
% 0.68/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.99 % set(auto2) -> clear(print_given).
% 0.68/0.99 assign(lrs_ticks,-1).
% 0.68/0.99 assign(sos_limit,10000).
% 0.68/0.99 assign(order,kbo).
% 0.68/0.99 set(lex_order_vars).
% 0.68/0.99 clear(print_given).
% 0.68/0.99
% 0.68/0.99 % formulas(sos). % not echoed (8 formulas)
% 0.68/0.99
% 0.68/0.99 ============================== end of input ==========================
% 0.68/0.99
% 0.68/0.99 % From the command line: assign(max_seconds, 300).
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.99
% 0.68/0.99 % Formulas that are not ordinary clauses:
% 0.68/0.99
% 0.68/0.99 ============================== end of process non-clausal formulas ===
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.99
% 0.68/0.99 ============================== PREDICATE ELIMINATION =================
% 0.68/0.99 1 -equidistant(A,B,C,C) | equalish(A,B) # label(identity_for_equidistance) # label(axiom). [assumption].
% 0.68/0.99 2 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 0.68/0.99 Derived: equalish(A,extension(B,A,C,C)). [resolve(1,a,2,a)].
% 0.68/0.99 3 equalish(A,extension(B,A,C,C)). [resolve(1,a,2,a)].
% 0.68/0.99 4 -equalish(A,B) | -between(C,D,A) | between(C,D,B) # label(between_substitution3) # label(axiom). [assumption].
% 0.68/0.99 Derived: -between(A,B,C) | between(A,B,extension(D,C,E,E)). [resolve(3,a,4,a)].
% 0.68/0.99
% 0.68/0.99 ============================== end predicate elimination =============
% 0.68/0.99
% 0.68/0.99 Auto_denials:
% 0.68/0.99 % copying label prove_a_between_a_and_b to answer in negative clause
% 0.68/0.99
% 0.68/0.99 Term ordering decisions:
% 0.68/0.99 Function symbol KB weights: a=1. b=1. extension=1. outer_pasch=1.
% 0.68/0.99
% 0.68/0.99 ============================== end of process initial clauses ========
% 0.68/0.99
% 0.68/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.99
% 0.68/0.99 ============================== end of clauses for search =============
% 0.68/0.99
% 0.68/0.99 ============================== SEARCH ================================
% 0.68/0.99
% 0.68/0.99 % Starting search at 0.01 seconds.
% 0.68/0.99
% 0.68/0.99 ============================== PROOF =================================
% 0.68/0.99 % SZS status Unsatisfiable
% 0.68/0.99 % SZS output start Refutation
% 0.68/0.99
% 0.68/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: prove_a_between_a_and_b.
% 0.68/0.99 % Length of proof is 21.
% 0.68/0.99 % Level of proof is 8.
% 0.68/0.99 % Maximum clause weight is 17.000.
% 0.68/0.99 % Given clauses 23.
% 0.68/0.99
% 0.68/0.99 1 -equidistant(A,B,C,C) | equalish(A,B) # label(identity_for_equidistance) # label(axiom). [assumption].
% 0.68/0.99 2 equidistant(A,extension(B,A,C,D),C,D) # label(segment_construction2) # label(axiom). [assumption].
% 0.68/0.99 3 equalish(A,extension(B,A,C,C)). [resolve(1,a,2,a)].
% 0.68/0.99 4 -equalish(A,B) | -between(C,D,A) | between(C,D,B) # label(between_substitution3) # label(axiom). [assumption].
% 0.68/0.99 5 between(A,B,extension(A,B,C,D)) # label(segment_construction1) # label(axiom). [assumption].
% 0.68/0.99 6 -between(a,a,b) # label(prove_a_between_a_and_b) # label(negated_conjecture) # answer(prove_a_between_a_and_b). [assumption].
% 0.68/0.99 7 -between(A,B,C) | -between(B,D,C) | between(A,B,D) # label(transitivity_for_betweeness) # label(axiom). [assumption].
% 0.68/0.99 8 -between(A,B,C) | -between(D,C,E) | between(A,outer_pasch(B,A,D,E,C),D) # label(outer_pasch1) # label(axiom). [assumption].
% 0.68/0.99 9 -between(A,B,C) | -between(D,C,E) | between(E,B,outer_pasch(B,A,D,E,C)) # label(outer_pasch2) # label(axiom). [assumption].
% 0.68/0.99 10 -between(A,B,C) | between(A,B,extension(D,C,E,E)). [resolve(3,a,4,a)].
% 0.68/0.99 12 between(A,A,A). [ur(7,a,5,a,b,5,a)].
% 0.68/0.99 13 -between(a,a,extension(a,b,A,B)) # answer(prove_a_between_a_and_b). [ur(7,b,5,a,c,6,a)].
% 0.68/0.99 40 between(A,A,extension(B,A,C,C)). [ur(10,a,12,a)].
% 0.68/0.99 60 between(A,B,B). [ur(7,a,5,a,b,40,a)].
% 0.68/0.99 63 between(A,B,extension(C,B,D,D)). [ur(10,a,60,a)].
% 0.68/0.99 64 between(A,A,outer_pasch(A,B,C,A,A)). [ur(9,a,60,a,b,60,a)].
% 0.68/0.99 69 between(A,outer_pasch(B,A,C,B,B),C). [ur(8,a,60,a,b,60,a)].
% 0.68/0.99 88 between(A,extension(B,C,D,D),C). [ur(7,a,60,a,b,63,a)].
% 0.68/0.99 164 -between(a,extension(a,b,A,B),outer_pasch(a,C,D,a,a)) # answer(prove_a_between_a_and_b). [ur(7,a,64,a,c,13,a)].
% 0.68/0.99 188 between(A,extension(B,C,D,D),outer_pasch(E,extension(B,C,D,D),C,E,E)). [ur(7,a,88,a,b,69,a)].
% 0.68/0.99 189 $F # answer(prove_a_between_a_and_b). [resolve(188,a,164,a)].
% 0.68/0.99
% 0.68/0.99 % SZS output end Refutation
% 0.68/0.99 ============================== end of proof ==========================
% 0.68/0.99
% 0.68/0.99 ============================== STATISTICS ============================
% 0.68/0.99
% 0.68/0.99 Given=23. Generated=293. Kept=184. proofs=1.
% 0.68/0.99 Usable=21. Sos=116. Demods=0. Limbo=23, Disabled=33. Hints=0.
% 0.68/0.99 Megabytes=0.26.
% 0.68/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of statistics =====================
% 0.68/0.99
% 0.68/0.99 ============================== end of search =========================
% 0.68/0.99
% 0.68/0.99 THEOREM PROVED
% 0.68/0.99 % SZS status Unsatisfiable
% 0.68/0.99
% 0.68/0.99 Exiting with 1 proof.
% 0.68/0.99
% 0.68/0.99 Process 11828 exit (max_proofs) Sat Jun 18 09:21:08 2022
% 0.68/0.99 Prover9 interrupted
%------------------------------------------------------------------------------