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 : n006.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:03 EDT 2022
% Result : Timeout 300.07s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO108+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 16:38:10 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.50/1.07 ============================== Prover9 ===============================
% 0.50/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.07 Process 18793 was started by sandbox2 on n006.cluster.edu,
% 0.50/1.07 Sat Jun 18 16:38:11 2022
% 0.50/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18640_n006.cluster.edu".
% 0.50/1.07 ============================== end of head ===========================
% 0.50/1.07
% 0.50/1.07 ============================== INPUT =================================
% 0.50/1.07
% 0.50/1.07 % Reading from file /tmp/Prover9_18640_n006.cluster.edu
% 0.50/1.07
% 0.50/1.07 set(prolog_style_variables).
% 0.50/1.07 set(auto2).
% 0.50/1.07 % set(auto2) -> set(auto).
% 0.50/1.07 % set(auto) -> set(auto_inference).
% 0.50/1.07 % set(auto) -> set(auto_setup).
% 0.50/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.07 % set(auto) -> set(auto_limits).
% 0.50/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.07 % set(auto) -> set(auto_denials).
% 0.50/1.07 % set(auto) -> set(auto_process).
% 0.50/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.07 % set(auto2) -> assign(stats, some).
% 0.50/1.07 % set(auto2) -> clear(echo_input).
% 0.50/1.07 % set(auto2) -> set(quiet).
% 0.50/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.07 % set(auto2) -> clear(print_given).
% 0.50/1.07 assign(lrs_ticks,-1).
% 0.50/1.07 assign(sos_limit,10000).
% 0.50/1.07 assign(order,kbo).
% 0.50/1.07 set(lex_order_vars).
% 0.50/1.07 clear(print_given).
% 0.50/1.07
% 0.50/1.07 % formulas(sos). % not echoed (20 formulas)
% 0.50/1.07
% 0.50/1.07 ============================== end of input ==========================
% 0.50/1.07
% 0.50/1.07 % From the command line: assign(max_seconds, 300).
% 0.50/1.07
% 0.50/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.07
% 0.50/1.07 % Formulas that are not ordinary clauses:
% 0.50/1.07 1 (all C all C1 (part_of(C1,C) <-> (all P (incident_c(P,C1) -> incident_c(P,C))))) # label(part_of_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 2 (all C all C1 all C2 (C = sum(C1,C2) <-> (all Q (incident_c(Q,C) <-> incident_c(Q,C1) | incident_c(Q,C2))))) # label(sum_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 3 (all P all C (end_point(P,C) <-> incident_c(P,C) & (all C1 all C2 (part_of(C1,C) & part_of(C2,C) & incident_c(P,C1) & incident_c(P,C2) -> part_of(C1,C2) | part_of(C2,C1))))) # label(end_point_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 4 (all P all C (inner_point(P,C) <-> incident_c(P,C) & -end_point(P,C))) # label(inner_point_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 5 (all P all C all C1 (meet(P,C,C1) <-> incident_c(P,C) & incident_c(P,C1) & (all Q (incident_c(Q,C) & incident_c(Q,C1) -> end_point(Q,C) & end_point(Q,C1))))) # label(meet_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 6 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 7 (all C (open(C) <-> (exists P end_point(P,C)))) # label(open_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 8 (all C all C1 (part_of(C1,C) & C1 != C -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 9 (all C all C1 all C2 all C3 (part_of(C1,C) & part_of(C2,C) & part_of(C3,C) & (exists P (end_point(P,C1) & end_point(P,C2) & end_point(P,C3))) -> part_of(C2,C3) | part_of(C3,C2) | part_of(C1,C2) | part_of(C2,C1) | part_of(C1,C3) | part_of(C3,C1))) # label(c2) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 10 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 11 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (meet(P,C1,C2) & C = sum(C1,C2))))) # label(c4) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 12 (all C all P all Q all R (end_point(P,C) & end_point(Q,C) & end_point(R,C) -> P = Q | P = R | Q = R)) # label(c5) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 13 (all C all P (end_point(P,C) -> (exists Q (end_point(Q,C) & P != Q)))) # label(c6) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 14 (all C all C1 all C2 all P (closed(C) & meet(P,C1,C2) & C = sum(C1,C2) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 15 (all C1 all C2 ((exists P meet(P,C1,C2)) -> (exists C C = sum(C1,C2)))) # label(c8) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 16 (all C all C1 ((all P (incident_c(P,C) <-> incident_c(P,C1))) -> C = C1)) # label(c9) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 17 (all C all P all Q all R (between_c(C,P,Q,R) <-> P != R & (exists Cpp (part_of(Cpp,C) & end_point(P,Cpp) & end_point(R,Cpp) & inner_point(Q,Cpp))))) # label(between_c_defn) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.07 18 (all C all P all Q all R (between_c2(C,P,Q,R) <-> P != Q & P != R & Q != R & (exists C1 exists C2 (meet(Q,C1,C2) & part_of(C1,C) & part_of(C2,C) & end_point(P,C1) & end_point(R,C2))))) # label(between_c2_defn) # label(hypothesis) # label(non_clause). [assumption].
% 0.50/1.07 19 (all C all P all Q all R (between_c3(C,P,Q,R) <-> P != Q & P != R & Q != R & (exists C1 exists C2 (meet(Q,C1,C2) & sum(C1,C2) = C & incident_c(P,C1) & incident_c(R,C2))))) # label(between_c3_defn) # label(hypothesis) # label(non_clause). [assumption].
% 0.50/1.07 20 -(all C all P all Q all R (between_c2(C,P,Q,R) <-> between_c3(C,P,Q,R))) # label(theorem_3_5) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.50/1.07
% 0.50/1.07 ============================== end of process non-clausal formulas ===
% 0.50/1.07
% 0.50/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/1.07
% 0.50/1.07 ============================== PREDICATE ELIMINATION =================
% 0.50/1.07 21 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.50/1.07 22 inner_point(f8(A),A) # label(c3) # label(axiom). [clausify(10)].
% 0.50/1.07 Derived: -end_point(f8(A),A). [resolve(21,a,22,a)].
% 0.50/1.07 23 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.50/1.07 Derived: incident_c(f8(A),A). [resolve(23,a,22,a)].
% 0.50/1.07 24 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.50/1.07 25 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom). [clausify(11)].
% 0.50/1.07 Derived: meet(f8(A),f9(A,f8(A)),f10(A,f8(A))). [resolve(25,a,22,a)].
% 0.50/1.07 Derived: meet(A,f9(B,A),f10(B,A)) | -incident_c(A,B) | end_point(A,B). [resolve(25,a,24,a)].
% 0.50/1.07 26 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom). [clausify(11)].
% 0.50/1.07 Derived: sum(f9(A,f8(A)),f10(A,f8(A))) = A. [resolve(26,a,22,a)].
% 0.50/1.07 Derived: sum(f9(A,B),f10(A,B)) = A | -incident_c(B,A) | end_point(B,A). [resolve(26,a,24,a)].
% 0.50/1.07 27 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)].
% 0.50/1.07 Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(27,b,21,a)].
% 0.50/1.07 Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)). [resolve(27,b,23,a)].
% 0.50/1.07 Derived: -between_c(A,B,C,D) | meet(C,f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)). [resolve(27,b,25,a)].
% 0.50/1.07 Derived: -between_c(A,B,C,D) | sum(f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)) = f14(A,B,C,D). [resolve(27,b,26,a)].
% 0.50/1.07 28 between_c(A,B,C,D) | D = B | -part_of(E,A) | -end_point(B,E) | -end_point(D,E) | -inner_point(C,E) # label(between_c_defn) # label(axiom). [clausify(17)].
% 0.50/1.07 Derived: between_c(A,B,f8(C),D) | D = B | -part_of(C,A) | -end_point(B,C) | -end_point(D,C). [resolve(28,f,22,a)].
% 0.50/1.07 Derived: between_c(A,B,C,D) | D = B | -part_of(E,A) | -end_point(B,E) | -end_point(D,E) | -incident_c(C,E) | end_point(C,E). [resolve(28,f,24,a)].
% 0.50/1.07 Derived: between_c(A,B,C,D) | D = B | -part_of(f14(E,F,C,V6),A) | -end_point(B,f14(E,F,C,V6)) | -end_point(D,f14(E,F,C,V6)) | -between_c(E,F,C,V6). [resolve(28,f,27,b)].
% 0.50/1.07 29 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(6)].
% 0.50/1.07 30 closed(A) | end_point(f6(A),A) # label(closed_defn) # label(axiom). [clausify(6)].
% 0.50/1.07 Derived:Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------