TSTP Solution File: GEO108-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO108-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:54:02 EDT 2022
% Result : Timeout 300.02s 300.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GEO108-1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.30 % Computer : n018.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sat Jun 18 11:31:33 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.66/0.99 ============================== Prover9 ===============================
% 0.66/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.99 Process 5031 was started by sandbox on n018.cluster.edu,
% 0.66/0.99 Sat Jun 18 11:31:33 2022
% 0.66/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4877_n018.cluster.edu".
% 0.66/0.99 ============================== end of head ===========================
% 0.66/0.99
% 0.66/0.99 ============================== INPUT =================================
% 0.66/0.99
% 0.66/0.99 % Reading from file /tmp/Prover9_4877_n018.cluster.edu
% 0.66/0.99
% 0.66/0.99 set(prolog_style_variables).
% 0.66/0.99 set(auto2).
% 0.66/0.99 % set(auto2) -> set(auto).
% 0.66/0.99 % set(auto) -> set(auto_inference).
% 0.66/0.99 % set(auto) -> set(auto_setup).
% 0.66/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.99 % set(auto) -> set(auto_limits).
% 0.66/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.99 % set(auto) -> set(auto_denials).
% 0.66/0.99 % set(auto) -> set(auto_process).
% 0.66/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.99 % set(auto2) -> assign(stats, some).
% 0.66/0.99 % set(auto2) -> clear(echo_input).
% 0.66/0.99 % set(auto2) -> set(quiet).
% 0.66/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.99 % set(auto2) -> clear(print_given).
% 0.66/0.99 assign(lrs_ticks,-1).
% 0.66/0.99 assign(sos_limit,10000).
% 0.66/0.99 assign(order,kbo).
% 0.66/0.99 set(lex_order_vars).
% 0.66/0.99 clear(print_given).
% 0.66/0.99
% 0.66/0.99 % formulas(sos). % not echoed (75 formulas)
% 0.66/0.99
% 0.66/0.99 ============================== end of input ==========================
% 0.66/0.99
% 0.66/0.99 % From the command line: assign(max_seconds, 300).
% 0.66/0.99
% 0.66/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.99
% 0.66/0.99 % Formulas that are not ordinary clauses:
% 0.66/0.99
% 0.66/0.99 ============================== end of process non-clausal formulas ===
% 0.66/0.99
% 0.66/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.99
% 0.66/0.99 ============================== PREDICATE ELIMINATION =================
% 0.66/0.99 1 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn_22) # label(axiom). [assumption].
% 0.66/0.99 2 inner_point(ax0_sk8(A),A) # label(c3_37) # label(axiom). [assumption].
% 0.66/0.99 Derived: -end_point(ax0_sk8(A),A). [resolve(1,a,2,a)].
% 0.66/0.99 3 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn_21) # label(axiom). [assumption].
% 0.66/0.99 Derived: incident_c(ax0_sk8(A),A). [resolve(3,a,2,a)].
% 0.66/0.99 4 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn_23) # label(axiom). [assumption].
% 0.66/0.99 5 -inner_point(A,B) | meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_38) # label(axiom). [assumption].
% 0.66/0.99 Derived: meet(ax0_sk8(A),ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(5,a,2,a)].
% 0.66/0.99 Derived: meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) | -incident_c(A,B) | end_point(A,B). [resolve(5,a,4,c)].
% 0.66/0.99 6 -inner_point(A,B) | B = sum(ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_39) # label(axiom). [assumption].
% 0.66/0.99 Derived: A = sum(ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(6,a,2,a)].
% 0.66/0.99 Derived: A = sum(ax0_sk9(B,A),ax0_sk10(B,A)) | -incident_c(B,A) | end_point(B,A). [resolve(6,a,4,c)].
% 0.66/0.99 7 -between_c(A,B,C,D) | inner_point(C,ax1_sk1(D,C,B,A)) # label(between_c_defn_5) # label(axiom). [assumption].
% 0.66/0.99 Derived: -between_c(A,B,C,D) | -end_point(C,ax1_sk1(D,C,B,A)). [resolve(7,b,1,a)].
% 0.66/0.99 Derived: -between_c(A,B,C,D) | incident_c(C,ax1_sk1(D,C,B,A)). [resolve(7,b,3,a)].
% 0.66/0.99 Derived: -between_c(A,B,C,D) | meet(C,ax0_sk9(C,ax1_sk1(D,C,B,A)),ax0_sk10(C,ax1_sk1(D,C,B,A))). [resolve(7,b,5,a)].
% 0.66/0.99 Derived: -between_c(A,B,C,D) | ax1_sk1(D,C,B,A) = sum(ax0_sk9(C,ax1_sk1(D,C,B,A)),ax0_sk10(C,ax1_sk1(D,C,B,A))). [resolve(7,b,6,a)].
% 0.66/0.99 8 A = B | -part_of(C,D) | -end_point(A,C) | -end_point(B,C) | -inner_point(E,C) | between_c(D,A,E,B) # label(between_c_defn_6) # Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------