TSTP Solution File: GEO011-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO011-5 : TPTP v8.1.0. Released v1.0.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:13 EDT 2022
% Result : Unsatisfiable 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO011-5 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n027.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 : Fri Jun 17 17:46:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 29300 was started by sandbox on n027.cluster.edu,
% 0.44/0.99 Fri Jun 17 17:46:07 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29125_n027.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_29125_n027.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (17 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 1 -colinear(A,B,C) | between(A,B,C) | between(B,C,A) | between(C,A,B) # label(colinearity4) # label(axiom). [assumption].
% 0.44/0.99 2 colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) # label(prove_lower_dimension_points_not_colinear) # label(negated_conjecture). [assumption].
% 0.44/0.99 3 -between(A,B,C) | colinear(A,B,C) # label(colinearity1) # label(axiom). [assumption].
% 0.44/0.99 4 -between(A,B,C) | colinear(C,A,B) # label(colinearity2) # label(axiom). [assumption].
% 0.44/0.99 5 -between(A,B,C) | colinear(B,C,A) # label(colinearity3) # label(axiom). [assumption].
% 0.44/0.99 Derived: between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) | between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) | between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2). [resolve(1,a,2,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99 Function symbol KB weights: lower_dimension_point_1=1. lower_dimension_point_2=1. lower_dimension_point_3=1. distance=1. extension=1. inner_pasch=1.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Unsatisfiable
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 7.
% 0.44/0.99 % Level of proof is 2.
% 0.44/0.99 % Maximum clause weight is 4.000.
% 0.44/0.99 % Given clauses 0.
% 0.44/0.99
% 0.44/0.99 1 -colinear(A,B,C) | between(A,B,C) | between(B,C,A) | between(C,A,B) # label(colinearity4) # label(axiom). [assumption].
% 0.44/0.99 2 colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) # label(prove_lower_dimension_points_not_colinear) # label(negated_conjecture). [assumption].
% 0.44/0.99 9 -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) # label(lower_dimension1) # label(axiom). [assumption].
% 0.44/0.99 10 -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) # label(lower_dimension2) # label(axiom). [assumption].
% 0.44/0.99 11 -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2) # label(lower_dimension3) # label(axiom). [assumption].
% 0.44/0.99 18 between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) | between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) | between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2). [resolve(1,a,2,a)].
% 0.44/0.99 19 $F. [copy(18),unit_del(a,9),unit_del(b,10),unit_del(c,11)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=0. Generated=13. Kept=12. proofs=1.
% 0.44/0.99 Usable=0. Sos=0. Demods=0. Limbo=12, Disabled=18. Hints=0.
% 0.44/0.99 Megabytes=0.04.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Unsatisfiable
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 29300 exit (max_proofs) Fri Jun 17 17:46:07 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------