TSTP Solution File: MGT020+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : Sun Jul 17 22:22:52 EDT 2022
% Result : Theorem 0.75s 1.05s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 9 12:32:06 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.75/1.05 ============================== Prover9 ===============================
% 0.75/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.05 Process 3224 was started by sandbox2 on n020.cluster.edu,
% 0.75/1.05 Thu Jun 9 12:32:07 2022
% 0.75/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3071_n020.cluster.edu".
% 0.75/1.05 ============================== end of head ===========================
% 0.75/1.05
% 0.75/1.05 ============================== INPUT =================================
% 0.75/1.05
% 0.75/1.05 % Reading from file /tmp/Prover9_3071_n020.cluster.edu
% 0.75/1.05
% 0.75/1.05 set(prolog_style_variables).
% 0.75/1.05 set(auto2).
% 0.75/1.05 % set(auto2) -> set(auto).
% 0.75/1.05 % set(auto) -> set(auto_inference).
% 0.75/1.05 % set(auto) -> set(auto_setup).
% 0.75/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.05 % set(auto) -> set(auto_limits).
% 0.75/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.05 % set(auto) -> set(auto_denials).
% 0.75/1.05 % set(auto) -> set(auto_process).
% 0.75/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.05 % set(auto2) -> assign(stats, some).
% 0.75/1.05 % set(auto2) -> clear(echo_input).
% 0.75/1.05 % set(auto2) -> set(quiet).
% 0.75/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.05 % set(auto2) -> clear(print_given).
% 0.75/1.05 assign(lrs_ticks,-1).
% 0.75/1.05 assign(sos_limit,10000).
% 0.75/1.05 assign(order,kbo).
% 0.75/1.05 set(lex_order_vars).
% 0.75/1.05 clear(print_given).
% 0.75/1.05
% 0.75/1.05 % formulas(sos). % not echoed (11 formulas)
% 0.75/1.05
% 0.75/1.05 ============================== end of input ==========================
% 0.75/1.05
% 0.75/1.05 % From the command line: assign(max_seconds, 300).
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.05
% 0.75/1.05 % Formulas that are not ordinary clauses:
% 0.75/1.05 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))))) # label(l3) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 2 (all E all T (environment(E) -> (in_environment(E,initial_FM_EP(E)) -> subpopulations(first_movers,efficient_producers,E,initial_FM_EP(E))) & (subpopulations(first_movers,efficient_producers,E,T) -> greater_or_equal(T,initial_FM_EP(E))))) # label(mp_earliest_time_point) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 3 (all E all T all T1 all T2 (environment(E) & greater_or_equal(T,T1) & greater_or_equal(T2,T) & subpopulations(first_movers,efficient_producers,E,T2) & greater(disbanding_rate(first_movers,T1),disbanding_rate(efficient_producers,T1)) -> (-decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))) -> greater(disbanding_rate(first_movers,T2),disbanding_rate(efficient_producers,T2))))) # label(mp_positive_function_difference) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 4 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> in_environment(E,T))) # label(mp_time_point_occurs) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 5 (all E (environment(E) -> greater_or_equal(initial_FM_EP(E),start_time(E)))) # label(mp_initial_time) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 6 (all E all T1 all T2 (environment(E) & greater_or_equal(T1,start_time(E)) & greater(T2,T1) & in_environment(E,T2) -> in_environment(E,T1))) # label(mp_times_in_order) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 7 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 8 (all X all Y (greater_or_equal(X,Y) -> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 9 (all E (environment(E) -> greater(disbanding_rate(first_movers,initial_FM_EP(E)),disbanding_rate(efficient_producers,initial_FM_EP(E))))) # label(a8) # label(hypothesis) # label(non_clause). [assumption].
% 0.75/1.05 10 (all E all T1 all T2 all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T1) & subpopulations(first_movers,efficient_producers,E,T2) & greater_or_equal(T,T1) & greater_or_equal(T2,T) -> subpopulations(first_movers,efficient_producers,E,T))) # label(a10) # label(hypothesis) # label(non_clause). [assumption].
% 0.75/1.05 11 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> greater(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T)))) # label(prove_l2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.05
% 0.75/1.05 ============================== end of process non-clausal formulas ===
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.05
% 0.75/1.05 ============================== PREDICATE ELIMINATION =================
% 0.75/1.05 12 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l3) # label(axiom). [clausify(1)].
% 0.75/1.05 13 environment(c1) # label(prove_l2) # label(negated_conjecture). [clausify(11)].
% 0.75/1.05 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(12,a,13,a)].
% 0.75/1.05 14 -environment(A) | greater_or_equal(initial_FM_EP(A),start_time(A)) # label(mp_initial_time) # label(axiom). [clausify(5)].
% 0.75/1.05 Derived: greater_or_equal(initial_FM_EP(c1),start_time(c1)). [resolve(14,a,13,a)].
% 0.75/1.05 15 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occurs) # label(axiom). [clausify(4)].
% 0.75/1.05 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(15,a,13,a)].
% 0.75/1.05 16 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater_or_equal(B,initial_FM_EP(A)) # label(mp_earliest_time_point) # label(axiom). [clausify(2)].
% 0.75/1.05 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | greater_or_equal(A,initial_FM_EP(c1)). [resolve(16,a,13,a)].
% 0.75/1.05 17 -environment(A) | greater(disbanding_rate(first_movers,initial_FM_EP(A)),disbanding_rate(efficient_producers,initial_FM_EP(A))) # label(a8) # label(hypothesis). [clausify(9)].
% 0.75/1.05 Derived: greater(disbanding_rate(first_movers,initial_FM_EP(c1)),disbanding_rate(efficient_producers,initial_FM_EP(c1))). [resolve(17,a,13,a)].
% 0.75/1.05 18 -environment(A) | -in_environment(A,initial_FM_EP(A)) | subpopulations(first_movers,efficient_producers,A,initial_FM_EP(A)) # label(mp_earliest_time_point) # label(axiom). [clausify(2)].
% 0.75/1.05 Derived: -in_environment(c1,initial_FM_EP(c1)) | subpopulations(first_movers,efficient_producers,c1,initial_FM_EP(c1)). [resolve(18,a,13,a)].
% 0.75/1.05 19 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater(C,B) | -in_environment(A,C) | in_environment(A,B) # label(mp_times_in_order) # label(axiom). [clausify(6)].
% 0.75/1.05 Derived: -greater_or_equal(A,start_time(c1)) | -greater(B,A) | -in_environment(c1,B) | in_environment(c1,A). [resolve(19,a,13,a)].
% 0.75/1.05 20 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(D,B) | -greater_or_equal(C,D) | subpopulations(first_movers,efficient_producers,A,D) # label(a10) # label(hypothesis). [clausify(10)].
% 0.75/1.05 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(C,A) | -greater_or_equal(B,C) | subpopulations(first_movers,efficient_producers,c1,C). [resolve(20,a,13,a)].
% 0.75/1.05 21 -environment(A) | -greater_or_equal(B,C) | -greater_or_equal(D,B) | -subpopulations(first_movers,efficient_producers,A,D) | -greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)) | decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) | greater(disbanding_rate(first_movers,D),disbanding_rate(efficient_producers,D)) # label(mp_positive_function_difference) # label(axiom). [clausify(3)].
% 0.75/1.05 Derived: -greater_or_equal(A,B) | -greater_or_equal(C,A) | -subpopulations(first_movers,efficient_producers,c1,C) | -greater(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)) | decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))) | greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)). [resolve(21,a,13,a)].
% 0.75/1.05
% 0.75/1.05 ============================== end predicate elimination =============
% 0.75/1.05
% 0.75/1.05 Auto_denials: (non-Horn, no changes).
% 0.75/1.05
% 0.75/1.05 Term ordering decisions:
% 0.75/1.05 Function symbol KB weights: efficient_producers=1. first_movers=1. c1=1. c2=1. disbanding_rate=1. difference=1. initial_FM_EP=1. start_time=1.
% 0.75/1.05
% 0.75/1.05 ============================== end of process initial clauses ========
% 0.75/1.05
% 0.75/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.05
% 0.75/1.05 ============================== end of clauses for search =============
% 0.75/1.05
% 0.75/1.05 ============================== SEARCH ================================
% 0.75/1.05
% 0.75/1.05 % Starting search at 0.01 seconds.
% 0.75/1.05
% 0.75/1.05 ============================== PROOF =================================
% 0.75/1.05 % SZS status Theorem
% 0.75/1.05 % SZS output start Refutation
% 0.75/1.05
% 0.75/1.05 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.75/1.05 % Length of proof is 44.
% 0.75/1.05 % Level of proof is 11.
% 0.75/1.05 % Maximum clause weight is 33.000.
% 0.75/1.05 % Given clauses 42.
% 0.75/1.05
% 0.75/1.05 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))))) # label(l3) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 2 (all E all T (environment(E) -> (in_environment(E,initial_FM_EP(E)) -> subpopulations(first_movers,efficient_producers,E,initial_FM_EP(E))) & (subpopulations(first_movers,efficient_producers,E,T) -> greater_or_equal(T,initial_FM_EP(E))))) # label(mp_earliest_time_point) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 3 (all E all T all T1 all T2 (environment(E) & greater_or_equal(T,T1) & greater_or_equal(T2,T) & subpopulations(first_movers,efficient_producers,E,T2) & greater(disbanding_rate(first_movers,T1),disbanding_rate(efficient_producers,T1)) -> (-decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))) -> greater(disbanding_rate(first_movers,T2),disbanding_rate(efficient_producers,T2))))) # label(mp_positive_function_difference) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 4 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> in_environment(E,T))) # label(mp_time_point_occurs) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 5 (all E (environment(E) -> greater_or_equal(initial_FM_EP(E),start_time(E)))) # label(mp_initial_time) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 6 (all E all T1 all T2 (environment(E) & greater_or_equal(T1,start_time(E)) & greater(T2,T1) & in_environment(E,T2) -> in_environment(E,T1))) # label(mp_times_in_order) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 8 (all X all Y (greater_or_equal(X,Y) -> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 9 (all E (environment(E) -> greater(disbanding_rate(first_movers,initial_FM_EP(E)),disbanding_rate(efficient_producers,initial_FM_EP(E))))) # label(a8) # label(hypothesis) # label(non_clause). [assumption].
% 0.75/1.05 11 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> greater(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T)))) # label(prove_l2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.05 12 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l3) # label(axiom). [clausify(1)].
% 0.75/1.05 13 environment(c1) # label(prove_l2) # label(negated_conjecture). [clausify(11)].
% 0.75/1.05 14 -environment(A) | greater_or_equal(initial_FM_EP(A),start_time(A)) # label(mp_initial_time) # label(axiom). [clausify(5)].
% 0.75/1.05 15 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occurs) # label(axiom). [clausify(4)].
% 0.75/1.05 16 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater_or_equal(B,initial_FM_EP(A)) # label(mp_earliest_time_point) # label(axiom). [clausify(2)].
% 0.75/1.05 17 -environment(A) | greater(disbanding_rate(first_movers,initial_FM_EP(A)),disbanding_rate(efficient_producers,initial_FM_EP(A))) # label(a8) # label(hypothesis). [clausify(9)].
% 0.75/1.05 18 -environment(A) | -in_environment(A,initial_FM_EP(A)) | subpopulations(first_movers,efficient_producers,A,initial_FM_EP(A)) # label(mp_earliest_time_point) # label(axiom). [clausify(2)].
% 0.75/1.05 19 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater(C,B) | -in_environment(A,C) | in_environment(A,B) # label(mp_times_in_order) # label(axiom). [clausify(6)].
% 0.75/1.05 21 -environment(A) | -greater_or_equal(B,C) | -greater_or_equal(D,B) | -subpopulations(first_movers,efficient_producers,A,D) | -greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)) | decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) | greater(disbanding_rate(first_movers,D),disbanding_rate(efficient_producers,D)) # label(mp_positive_function_difference) # label(axiom). [clausify(3)].
% 0.75/1.05 22 subpopulations(first_movers,efficient_producers,c1,c2) # label(prove_l2) # label(negated_conjecture). [clausify(11)].
% 0.75/1.05 23 -greater(disbanding_rate(first_movers,c2),disbanding_rate(efficient_producers,c2)) # label(prove_l2) # label(negated_conjecture). [clausify(11)].
% 0.75/1.05 25 -greater_or_equal(A,B) | greater(A,B) | B = A # label(mp_greater_or_equal) # label(axiom). [clausify(8)].
% 0.75/1.05 26 -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(12,a,13,a)].
% 0.75/1.05 27 greater_or_equal(initial_FM_EP(c1),start_time(c1)). [resolve(14,a,13,a)].
% 0.75/1.05 28 -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(15,a,13,a)].
% 0.75/1.05 29 -subpopulations(first_movers,efficient_producers,c1,A) | greater_or_equal(A,initial_FM_EP(c1)). [resolve(16,a,13,a)].
% 0.75/1.05 30 greater(disbanding_rate(first_movers,initial_FM_EP(c1)),disbanding_rate(efficient_producers,initial_FM_EP(c1))). [resolve(17,a,13,a)].
% 0.75/1.05 31 -in_environment(c1,initial_FM_EP(c1)) | subpopulations(first_movers,efficient_producers,c1,initial_FM_EP(c1)). [resolve(18,a,13,a)].
% 0.75/1.05 32 -greater_or_equal(A,start_time(c1)) | -greater(B,A) | -in_environment(c1,B) | in_environment(c1,A). [resolve(19,a,13,a)].
% 0.75/1.05 34 -greater_or_equal(A,B) | -greater_or_equal(C,A) | -subpopulations(first_movers,efficient_producers,c1,C) | -greater(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)) | decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))) | greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)). [resolve(21,a,13,a)].
% 0.75/1.05 36 -decreases(difference(disbanding_rate(first_movers,c2),disbanding_rate(efficient_producers,c2))). [resolve(26,a,22,a)].
% 0.75/1.05 38 in_environment(c1,c2). [resolve(28,a,22,a)].
% 0.75/1.05 39 greater_or_equal(c2,initial_FM_EP(c1)). [resolve(29,a,22,a)].
% 0.75/1.05 44 -greater_or_equal(A,B) | -greater_or_equal(c2,A) | -greater(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)) | decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(34,c,22,a),unit_del(e,23)].
% 0.75/1.05 46 -greater_or_equal(A,start_time(c1)) | -greater(c2,A) | in_environment(c1,A). [resolve(38,a,32,c)].
% 0.75/1.05 47 greater(c2,initial_FM_EP(c1)) | initial_FM_EP(c1) = c2. [resolve(39,a,25,a)].
% 0.75/1.05 48 -greater_or_equal(c2,c2). [ur(34,a,39,a,c,22,a,d,30,a,e,36,a,f,23,a)].
% 0.75/1.05 53 -greater(c2,initial_FM_EP(c1)) | in_environment(c1,initial_FM_EP(c1)). [resolve(46,a,27,a)].
% 0.75/1.05 54 in_environment(c1,initial_FM_EP(c1)) | initial_FM_EP(c1) = c2. [resolve(53,a,47,a)].
% 0.75/1.05 56 initial_FM_EP(c1) = c2 | subpopulations(first_movers,efficient_producers,c1,initial_FM_EP(c1)). [resolve(54,a,31,a)].
% 0.75/1.05 60 initial_FM_EP(c1) = c2 | greater_or_equal(initial_FM_EP(c1),initial_FM_EP(c1)). [resolve(56,b,29,a)].
% 0.75/1.05 61 initial_FM_EP(c1) = c2 | -decreases(difference(disbanding_rate(first_movers,initial_FM_EP(c1)),disbanding_rate(efficient_producers,initial_FM_EP(c1)))). [resolve(56,b,26,a)].
% 0.75/1.05 69 decreases(difference(disbanding_rate(first_movers,initial_FM_EP(c1)),disbanding_rate(efficient_producers,initial_FM_EP(c1)))) | initial_FM_EP(c1) = c2. [resolve(44,a,60,b),unit_del(a,39),unit_del(b,30)].
% 0.75/1.05 72 initial_FM_EP(c1) = c2. [resolve(69,a,61,b),merge(b)].
% 0.75/1.05 79 $F. [back_rewrite(39),rewrite([72(3)]),unit_del(a,48)].
% 0.75/1.05
% 0.75/1.05 % SZS output end Refutation
% 0.75/1.05 ============================== end of proof ==========================
% 0.75/1.05
% 0.75/1.05 ============================== STATISTICS ============================
% 0.75/1.05
% 0.75/1.05 Given=42. Generated=82. Kept=57. proofs=1.
% 0.75/1.05 Usable=23. Sos=0. Demods=1. Limbo=7, Disabled=50. Hints=0.
% 0.75/1.05 Megabytes=0.12.
% 0.75/1.05 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.75/1.05
% 0.75/1.05 ============================== end of statistics =====================
% 0.75/1.05
% 0.75/1.05 ============================== end of search =========================
% 0.75/1.05
% 0.75/1.05 THEOREM PROVED
% 0.75/1.05 % SZS status Theorem
% 0.75/1.05
% 0.75/1.05 Exiting with 1 proof.
% 0.75/1.05
% 0.75/1.05 Process 3224 exit (max_proofs) Thu Jun 9 12:32:07 2022
% 0.75/1.05 Prover9 interrupted
%------------------------------------------------------------------------------