TSTP Solution File: GEO077-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO077-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:47 EDT 2022
% Result : Unsatisfiable 18.22s 18.55s
% Output : Refutation 18.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO077-4 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 12:39:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 19757 was started by sandbox on n010.cluster.edu,
% 0.43/1.00 Sat Jun 18 12:39:08 2022
% 0.43/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19597_n010.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_19597_n010.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (42 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00
% 0.43/1.00 ============================== end of process non-clausal formulas ===
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.00
% 0.43/1.00 ============================== PREDICATE ELIMINATION =================
% 0.43/1.00 1 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10D) # label(axiom). [assumption].
% 0.43/1.00 2 collinear(point1,point2,point3) # label(prove_points_noncollinear) # label(negated_conjecture). [assumption].
% 0.43/1.00 3 plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | collinear(A,B,C) | A = B | A = C | B = C # label(axiom_G7D) # label(axiom). [assumption].
% 0.43/1.00 Derived: -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | line(line_through_3_points(point1,point2,point3)). [resolve(1,h,2,a)].
% 0.43/1.00 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(1,h,3,e)].
% 0.43/1.00 4 on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | collinear(A,B,C) | A = B | A = C | B = C # label(axiom_G7A) # label(axiom). [assumption].
% 0.43/1.00 Derived: on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)). [resolve(4,e,1,h)].
% 0.43/1.00 5 on(A,plane_for_points(B,A,C)) | -point(B) | -point(A) | -point(C) | collinear(B,A,C) | B = A | B = C | A = C # label(axiom_G7B) # label(axiom). [assumption].
% 0.43/1.00 Derived: on(A,plane_for_points(B,A,C)) | -point(B) | -point(A) | -point(C) | B = A | B = C | A = C | -point(B) | -point(A) | -point(C) | B = A | B = C | A = C | line(line_through_3_points(B,A,C)). [resolve(5,e,1,h)].
% 0.43/1.00 6 on(A,plane_for_points(B,C,A)) | -point(B) | -point(C) | -point(A) | collinear(B,C,A) | B = C | B = A | C = A # label(axiom_G7C) # label(axiom). [assumption].
% 0.72/1.04 Derived: on(A,plane_for_points(B,C,A)) | -point(B) | -point(C) | -point(A) | B = C | B = A | C = A | -point(B) | -point(C) | -point(A) | B = C | B = A | C = A | line(line_through_3_points(B,C,A)). [resolve(6,e,1,h)].
% 0.72/1.04 7 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10A) # label(axiom). [assumption].
% 0.72/1.04 Derived: -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | on(point1,line_through_3_points(point1,point2,point3)). [resolve(7,h,2,a)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(7,h,3,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(7,h,4,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | on(B,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(7,h,5,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | on(C,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(7,h,6,e)].
% 0.72/1.04 8 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10B) # label(axiom). [assumption].
% 0.72/1.04 Derived: -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | on(point2,line_through_3_points(point1,point2,point3)). [resolve(8,h,2,a)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(8,h,3,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(8,h,4,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | on(B,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(8,h,5,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | on(C,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(8,h,6,e)].
% 0.72/1.04 9 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10C) # label(axiom). [assumption].
% 0.72/1.04 Derived: -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | on(point3,line_through_3_points(point1,point2,point3)). [resolve(9,h,2,a)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | plane(plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(9,h,3,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | on(A,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(9,h,4,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | on(B,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(9,h,5,e)].
% 0.72/1.04 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | on(C,plane_for_points(A,B,C)) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C. [resolve(9,h,6,e)].
% 0.72/1.04 10 collinear(A,B,C) | -on(A,D) | -on(B,D) | -on(C,D) | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -line(D) # label(axiom_G10E) # label(axiom). [assumption].
% 18.22/18.55 Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | line(line_through_3_points(A,C,D)). [resolve(10,a,1,h)].
% 18.22/18.55 Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | on(A,line_through_3_points(A,C,D)). [resolve(10,a,7,h)].
% 18.22/18.55 Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | on(C,line_through_3_points(A,C,D)). [resolve(10,a,8,h)].
% 18.22/18.55 Derived: -on(A,B) | -on(C,B) | -on(D,B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | -line(B) | -point(A) | -point(C) | -point(D) | A = C | A = D | C = D | on(D,line_through_3_points(A,C,D)). [resolve(10,a,9,h)].
% 18.22/18.55 11 -point(A) | -point(B) | -point(C) | collinear(A,B,C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E # label(axiom_G7E) # label(axiom). [assumption].
% 18.22/18.55 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)). [resolve(11,d,1,h)].
% 18.22/18.55 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)). [resolve(11,d,7,h)].
% 18.22/18.55 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)). [resolve(11,d,8,h)].
% 18.22/18.55 Derived: -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | -on(A,D) | -on(B,D) | -on(C,D) | -plane(D) | -on(A,E) | -on(B,E) | -on(C,E) | -plane(E) | D = E | -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)). [resolve(11,d,9,h)].
% 18.22/18.55
% 18.22/18.55 ============================== end predicate elimination =============
% 18.22/18.55
% 18.22/18.55 Auto_denials: (non-Horn, no changes).
% 18.22/18.55
% 18.22/18.55 Term ordering decisions:
% 18.22/18.55 Function symbol KB weights: point1=1. point2=1. point3=1. a_line=1. at_least_one_line=1. line_from_to=1. point_1_on_line=1. point_2_on_line=1. point_on_plane=1. point_not_on_line=1. point_not_on_plane=1. line_through_3_points=1. plane_for_points=1. common_point_on_planes=1.
% 18.22/18.55
% 18.22/18.55 ============================== end of process initial clauses ========
% 18.22/18.55
% 18.22/18.55 ============================== CLAUSES FOR SEARCH ====================
% 18.22/18.55
% 18.22/18.55 ============================== end of clauses for search =============
% 18.22/18.55
% 18.22/18.55 ============================== SEARCH ================================
% 18.22/18.55
% 18.22/18.55 % Starting search at 0.15 seconds.
% 18.22/18.55
% 18.22/18.55 Low Water (keep): wt=72.000, iters=3344
% 18.22/18.55
% 18.22/18.55 Low Water (keep): wt=69.000, iters=3334
% 18.22/18.55
% 18.22/18.55 Low Water (keep): wt=49.000, iters=3334
% 18.22/18.55
% 18.22/18.55 Low Water (keep): wt=48.000, iters=3360
% 18.22/18.55
% 18.22/18.55 Low Water (keep): wt=45.000, iters=3380
% 18.22/18.55
% 18.22/18.55 Low Water (keep): wt=44.000, iters=3338
% 18.22/18.55
% 18.22/18.55 ============================== PROOF =================================
% 18.22/18.55 % SZS status Unsatisfiable
% 18.22/18.55 % SZS output start Refutation
% 18.22/18.55
% 18.22/18.55 % Proof 1 at 17.52 (+ 0.04) seconds.
% 18.22/18.55 % Length of proof is 30.
% 18.22/18.55 % Level of proof is 4.
% 18.22/18.55 % Maximum clause weight is 26.000.
% 18.22/18.55 % Given clauses 271.
% 18.22/18.55
% 18.22/18.55 1 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | line(line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10D) # label(axiom). [assumption].
% 18.22/18.55 2 collinear(point1,point2,point3) # label(prove_points_noncollinear) # label(negated_conjecture). [assumption].
% 18.22/18.55 7 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(A,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10A) # label(axiom). [assumption].
% 18.22/18.55 8 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(B,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10B) # label(axiom). [assumption].
% 18.22/18.55 9 -point(A) | -point(B) | -point(C) | A = B | A = C | B = C | on(C,line_through_3_points(A,B,C)) | -collinear(A,B,C) # label(axiom_G10C) # label(axiom). [assumption].
% 18.22/18.55 13 point(point1) # label(point1) # label(hypothesis). [assumption].
% 18.22/18.55 14 point(point2) # label(point2) # label(hypothesis). [assumption].
% 18.22/18.55 15 point(point3) # label(point3) # label(hypothesis). [assumption].
% 18.22/18.55 16 line(a_line) # label(line) # label(hypothesis). [assumption].
% 18.22/18.55 17 on(point1,a_line) # label(point1_on_line) # label(hypothesis). [assumption].
% 18.22/18.55 18 on(point2,a_line) # label(point2_on_line) # label(hypothesis). [assumption].
% 18.22/18.55 19 -on(point3,a_line) # label(point3_not_on_line) # label(hypothesis). [assumption].
% 18.22/18.55 20 point1 != point2 # label(point1_not_point2) # label(hypothesis). [assumption].
% 18.22/18.55 21 point2 != point1. [copy(20),flip(a)].
% 18.22/18.55 22 point1 != point3 # label(point1_not_point3) # label(hypothesis). [assumption].
% 18.22/18.55 23 point3 != point1. [copy(22),flip(a)].
% 18.22/18.55 24 point2 != point3 # label(point2_not_point3) # label(hypothesis). [assumption].
% 18.22/18.55 25 point3 != point2. [copy(24),flip(a)].
% 18.22/18.55 46 -on(A,B) | A = C | -on(C,B) | B = D | -on(A,D) | -on(C,D) | -point(A) | -point(C) | -line(B) | -line(D) # label(axiom_G1D) # label(axiom). [assumption].
% 18.22/18.55 48 -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | line(line_through_3_points(point1,point2,point3)). [resolve(1,h,2,a)].
% 18.22/18.55 49 line(line_through_3_points(point1,point2,point3)). [copy(48),flip(d),flip(e),flip(f),unit_del(a,13),unit_del(b,14),unit_del(c,15),unit_del(d,21),unit_del(e,23),unit_del(f,25)].
% 18.22/18.55 58 -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | on(point1,line_through_3_points(point1,point2,point3)). [resolve(7,h,2,a)].
% 18.22/18.55 59 on(point1,line_through_3_points(point1,point2,point3)). [copy(58),flip(d),flip(e),flip(f),unit_del(a,13),unit_del(b,14),unit_del(c,15),unit_del(d,21),unit_del(e,23),unit_del(f,25)].
% 18.22/18.55 68 -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | on(point2,line_through_3_points(point1,point2,point3)). [resolve(8,h,2,a)].
% 18.22/18.55 69 on(point2,line_through_3_points(point1,point2,point3)). [copy(68),flip(d),flip(e),flip(f),unit_del(a,13),unit_del(b,14),unit_del(c,15),unit_del(d,21),unit_del(e,23),unit_del(f,25)].
% 18.22/18.55 78 -point(point1) | -point(point2) | -point(point3) | point1 = point2 | point1 = point3 | point2 = point3 | on(point3,line_through_3_points(point1,point2,point3)). [resolve(9,h,2,a)].
% 18.22/18.55 79 on(point3,line_through_3_points(point1,point2,point3)). [copy(78),flip(d),flip(e),flip(f),unit_del(a,13),unit_del(b,14),unit_del(c,15),unit_del(d,21),unit_del(e,23),unit_del(f,25)].
% 18.22/18.55 166 point2 = A | -on(A,a_line) | a_line = B | -on(point2,B) | -on(A,B) | -point(A) | -line(B). [resolve(46,a,18,a),unit_del(f,14),unit_del(h,16)].
% 18.22/18.55 9439 line_through_3_points(point1,point2,point3) = a_line. [resolve(166,e,59,a),flip(c),unit_del(a,21),unit_del(b,17),unit_del(d,69),unit_del(e,13),unit_del(f,49)].
% 18.22/18.55 9513 $F. [back_rewrite(79),rewrite([9439(5)]),unit_del(a,19)].
% 18.22/18.55
% 18.22/18.55 % SZS output end Refutation
% 18.22/18.55 ============================== end of proof ==========================
% 18.22/18.55
% 18.22/18.55 ============================== STATISTICS ============================
% 18.22/18.55
% 18.22/18.55 Given=271. Generated=54824. Kept=9468. proofs=1.
% 18.22/18.55 Usable=243. Sos=6825. Demods=3. Limbo=74, Disabled=2396. Hints=0.
% 18.22/18.55 Megabytes=14.20.
% 18.22/18.55 User_CPU=17.52, System_CPU=0.04, Wall_clock=18.
% 18.22/18.55
% 18.22/18.55 ============================== end of statistics =====================
% 18.22/18.55
% 18.22/18.55 ============================== end of search =========================
% 18.22/18.55
% 18.22/18.55 THEOREM PROVED
% 18.22/18.55 % SZS status Unsatisfiable
% 18.22/18.55
% 18.22/18.55 Exiting with 1 proof.
% 18.22/18.55
% 18.22/18.55 Process 19757 exit (max_proofs) Sat Jun 18 12:39:26 2022
% 18.22/18.55 Prover9 interrupted
%------------------------------------------------------------------------------