TSTP Solution File: SYN214-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN214-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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 : Thu Jul 21 11:17:19 EDT 2022
% Result : Unsatisfiable 0.88s 1.60s
% Output : Refutation 0.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN214-10 : TPTP v8.1.0. Released v7.5.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 23:32:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.88/1.60 ============================== Prover9 ===============================
% 0.88/1.60 Prover9 (32) version 2009-11A, November 2009.
% 0.88/1.60 Process 29547 was started by sandbox on n014.cluster.edu,
% 0.88/1.60 Mon Jul 11 23:32:20 2022
% 0.88/1.60 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29394_n014.cluster.edu".
% 0.88/1.60 ============================== end of head ===========================
% 0.88/1.60
% 0.88/1.60 ============================== INPUT =================================
% 0.88/1.60
% 0.88/1.60 % Reading from file /tmp/Prover9_29394_n014.cluster.edu
% 0.88/1.60
% 0.88/1.60 set(prolog_style_variables).
% 0.88/1.60 set(auto2).
% 0.88/1.60 % set(auto2) -> set(auto).
% 0.88/1.60 % set(auto) -> set(auto_inference).
% 0.88/1.60 % set(auto) -> set(auto_setup).
% 0.88/1.60 % set(auto_setup) -> set(predicate_elim).
% 0.88/1.60 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.88/1.60 % set(auto) -> set(auto_limits).
% 0.88/1.60 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.88/1.60 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.88/1.60 % set(auto) -> set(auto_denials).
% 0.88/1.60 % set(auto) -> set(auto_process).
% 0.88/1.60 % set(auto2) -> assign(new_constants, 1).
% 0.88/1.60 % set(auto2) -> assign(fold_denial_max, 3).
% 0.88/1.60 % set(auto2) -> assign(max_weight, "200.000").
% 0.88/1.60 % set(auto2) -> assign(max_hours, 1).
% 0.88/1.60 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.88/1.60 % set(auto2) -> assign(max_seconds, 0).
% 0.88/1.60 % set(auto2) -> assign(max_minutes, 5).
% 0.88/1.60 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.88/1.60 % set(auto2) -> set(sort_initial_sos).
% 0.88/1.60 % set(auto2) -> assign(sos_limit, -1).
% 0.88/1.60 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.88/1.60 % set(auto2) -> assign(max_megs, 400).
% 0.88/1.60 % set(auto2) -> assign(stats, some).
% 0.88/1.60 % set(auto2) -> clear(echo_input).
% 0.88/1.60 % set(auto2) -> set(quiet).
% 0.88/1.60 % set(auto2) -> clear(print_initial_clauses).
% 0.88/1.60 % set(auto2) -> clear(print_given).
% 0.88/1.60 assign(lrs_ticks,-1).
% 0.88/1.60 assign(sos_limit,10000).
% 0.88/1.60 assign(order,kbo).
% 0.88/1.60 set(lex_order_vars).
% 0.88/1.60 clear(print_given).
% 0.88/1.60
% 0.88/1.60 % formulas(sos). % not echoed (363 formulas)
% 0.88/1.60
% 0.88/1.60 ============================== end of input ==========================
% 0.88/1.60
% 0.88/1.60 % From the command line: assign(max_seconds, 300).
% 0.88/1.60
% 0.88/1.60 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.88/1.60
% 0.88/1.60 % Formulas that are not ordinary clauses:
% 0.88/1.60
% 0.88/1.60 ============================== end of process non-clausal formulas ===
% 0.88/1.60
% 0.88/1.60 ============================== PROCESS INITIAL CLAUSES ===============
% 0.88/1.60
% 0.88/1.60 ============================== PREDICATE ELIMINATION =================
% 0.88/1.60
% 0.88/1.60 ============================== end predicate elimination =============
% 0.88/1.60
% 0.88/1.60 Auto_denials:
% 0.88/1.60 % copying label prove_this to answer in negative clause
% 0.88/1.60
% 0.88/1.60 Term ordering decisions:
% 0.88/1.60 Function symbol KB weights: true=1. b=1. e=1. d=1. c=1. a=1. p0=1. q0=1. l1=1. n0=1. l2=1. k2=1. l3=1. n5=1. q3=1. n4=1. q4=1. m4=1. q5=1. m5=1. s3=1. r5=1. r0=1. s0=1. l0=1. k1=1. k0=1. s1=1. r2=1. n2=1. s2=1. m2=1. r1=1. n3=1. s4=1. k4=1. l4=1. k5=1. r4=1. s5=1. l5=1. p2=1. m0=1. m1=1. n1=1. q1=1. p1=1. k3=1. q2=1. m3=1. r3=1. p3=1. p4=1. p5=1. ifeq=1.
% 0.88/1.60
% 0.88/1.60 ============================== end of process initial clauses ========
% 0.88/1.60
% 0.88/1.60 ============================== CLAUSES FOR SEARCH ====================
% 0.88/1.60
% 0.88/1.60 ============================== end of clauses for search =============
% 0.88/1.60
% 0.88/1.60 ============================== SEARCH ================================
% 0.88/1.60
% 0.88/1.60 % Starting search at 0.07 seconds.
% 0.88/1.60
% 0.88/1.60 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 31 (0.00 of 0.44 sec).
% 0.88/1.60
% 0.88/1.60 ============================== PROOF =================================
% 0.88/1.60 % SZS status Unsatisfiable
% 0.88/1.60 % SZS output start Refutation
% 0.88/1.60
% 0.88/1.60 % Proof 1 at 0.48 (+ 0.01) seconds: prove_this.
% 0.88/1.60 % Length of proof is 103.
% 0.88/1.60 % Level of proof is 18.
% 0.88/1.60 % Maximum clause weight is 30.000.
% 0.88/1.60 % Given clauses 627.
% 0.88/1.60
% 0.88/1.60 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 0.88/1.60 2 s0(d) = true # label(axiom_1) # label(axiom). [assumption].
% 0.88/1.60 3 true = s0(d). [copy(2),flip(a)].
% 0.88/1.60 10 s0(b) = true # label(axiom_5) # label(axiom). [assumption].
% 0.88/1.60 11 s0(d) = s0(b). [copy(10),rewrite([3(3)]),flip(a)].
% 0.88/1.60 18 r0(b) = true # label(axiom_9) # label(axiom). [assumption].
% 0.88/1.60 19 s0(b) = r0(b). [copy(18),rewrite([3(3),11(4)]),flip(a)].
% 0.88/1.60 28 p0(b,A) = true # label(axiom_14) # label(axiom). [assumption].
% 0.88/1.60 29 p0(b,A) = r0(b). [copy(28),rewrite([3(3),11(4),19(4)])].
% 0.88/1.60 34 q0(A,d) = true # label(axiom_17) # label(axiom). [assumption].
% 0.88/1.60 35 q0(A,d) = r0(b). [copy(34),rewrite([3(3),11(4),19(4)])].
% 0.88/1.60 38 m0(A,d,B) = true # label(axiom_19) # label(axiom). [assumption].
% 0.88/1.60 39 m0(A,d,B) = r0(b). [copy(38),rewrite([3(3),11(4),19(4)])].
% 0.88/1.60 47 l0(c) = true # label(axiom_24) # label(axiom). [assumption].
% 0.88/1.60 48 l0(c) = r0(b). [copy(47),rewrite([3(3),11(4),19(4)])].
% 0.88/1.60 237 ifeq(p0(A,B),true,p1(B,B,B),true) = true # label(rule_085) # label(axiom). [assumption].
% 0.88/1.60 238 ifeq(p0(A,B),r0(b),p1(B,B,B),r0(b)) = r0(b). [copy(237),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 285 ifeq(m0(A,B,C),true,q1(C,C,C),true) = true # label(rule_110) # label(axiom). [assumption].
% 0.88/1.60 286 ifeq(m0(A,B,C),r0(b),q1(C,C,C),r0(b)) = r0(b). [copy(285),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 311 ifeq(q1(d,A,d),true,ifeq(q0(B,A),true,ifeq(s0(d),true,r1(B),true),true),true) = true # label(rule_124) # label(axiom). [assumption].
% 0.88/1.60 312 ifeq(q1(d,A,d),r0(b),ifeq(q0(B,A),r0(b),r1(B),r0(b)),r0(b)) = r0(b). [copy(311),rewrite([3(4),11(5),19(5),3(7),11(8),19(8),11(10),19(10),3(11),11(12),19(12),3(14),11(15),19(15),1(16),3(10),11(11),19(11),3(13),11(14),19(14),3(16),11(17),19(17)])].
% 0.88/1.60 313 ifeq(p0(A,A),true,s1(A),true) = true # label(rule_125) # label(axiom). [assumption].
% 0.88/1.60 314 ifeq(p0(A,A),r0(b),s1(A),r0(b)) = r0(b). [copy(313),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 315 ifeq(s1(A),true,ifeq(q0(B,C),true,s1(B),true),true) = true # label(rule_126) # label(axiom). [assumption].
% 0.88/1.60 316 ifeq(s1(A),r0(b),ifeq(q0(B,C),r0(b),s1(B),r0(b)),r0(b)) = r0(b). [copy(315),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9),3(11),11(12),19(12),3(14),11(15),19(15)])].
% 0.88/1.60 327 ifeq(s1(A),true,ifeq(p0(B,B),true,ifeq(m0(C,A,D),true,l2(D,D),true),true),true) = true # label(rule_133) # label(axiom). [assumption].
% 0.88/1.60 328 ifeq(s1(A),r0(b),ifeq(p0(B,B),r0(b),ifeq(m0(C,A,D),r0(b),l2(D,D),r0(b)),r0(b)),r0(b)) = r0(b). [copy(327),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9),3(11),11(12),19(12),3(14),11(15),19(15),3(17),11(18),19(18),3(20),11(21),19(21)])].
% 0.88/1.60 335 ifeq(p1(A,B,C),true,n2(C),true) = true # label(rule_137) # label(axiom). [assumption].
% 0.88/1.60 336 ifeq(p1(A,B,C),r0(b),n2(C),r0(b)) = r0(b). [copy(335),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 369 ifeq(q1(A,A,A),true,p2(A,A,A),true) = true # label(rule_154) # label(axiom). [assumption].
% 0.88/1.60 370 ifeq(q1(A,A,A),r0(b),p2(A,A,A),r0(b)) = r0(b). [copy(369),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 437 ifeq(r1(A),true,ifeq(l0(A),true,r2(A),true),true) = true # label(rule_188) # label(axiom). [assumption].
% 0.88/1.60 438 ifeq(r1(A),r0(b),ifeq(l0(A),r0(b),r2(A),r0(b)),r0(b)) = r0(b). [copy(437),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9),3(11),11(12),19(12),3(14),11(15),19(15)])].
% 0.88/1.60 537 ifeq(p2(A,B,C),true,n3(C),true) = true # label(rule_240) # label(axiom). [assumption].
% 0.88/1.60 538 ifeq(p2(A,B,C),r0(b),n3(C),r0(b)) = r0(b). [copy(537),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 545 ifeq(n2(A),true,p3(A,A,A),true) = true # label(rule_244) # label(axiom). [assumption].
% 0.88/1.60 546 ifeq(n2(A),r0(b),p3(A,A,A),r0(b)) = r0(b). [copy(545),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 573 ifeq(r2(A),true,ifeq(l2(B,B),true,ifeq(s1(C),true,q3(A,A),true),true),true) = true # label(rule_258) # label(axiom). [assumption].
% 0.88/1.60 574 ifeq(r2(A),r0(b),ifeq(l2(B,B),r0(b),ifeq(s1(C),r0(b),q3(A,A),r0(b)),r0(b)),r0(b)) = r0(b). [copy(573),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9),3(11),11(12),19(12),3(14),11(15),19(15),3(17),11(18),19(18),3(20),11(21),19(21)])].
% 0.88/1.60 609 ifeq(p3(A,B,C),true,l4(C),true) = true # label(rule_277) # label(axiom). [assumption].
% 0.88/1.60 610 ifeq(p3(A,B,C),r0(b),l4(C),r0(b)) = r0(b). [copy(609),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 0.88/1.60 649 ifeq(q3(A,B),true,ifeq(n3(C),true,ifeq(p0(D,C),true,r4(C),true),true),true) = true # label(rule_298) # label(axiom). [assumption].
% 0.88/1.60 650 ifeq(q3(A,B),r0(b),ifeq(n3(C),r0(b),ifeq(p0(D,C),r0(b),r4(C),r0(b)),r0(b)),r0(b)) = r0(b). [copy(649),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9),3(11),11(12),19(12),3(14),11(15),19(15),3(17),11(18),19(18),3(20),11(21),19(21)])].
% 0.88/1.60 711 ifeq(r4(A),true,ifeq(l4(B),true,s5(B),true),true) = true # label(rule_329) # label(axiom). [assumption].
% 0.88/1.60 712 ifeq(r4(A),r0(b),ifeq(l4(B),r0(b),s5(B),r0(b)),r0(b)) = r0(b). [copy(711),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9),3(11),11(12),19(12),3(14),11(15),19(15)])].
% 0.88/1.60 715 s5(c) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 0.88/1.60 716 s5(c) != r0(b) # answer(prove_this). [copy(715),rewrite([3(3),11(4),19(4)])].
% 0.88/1.60 724 s5(c) = c_0. [new_symbol(716)].
% 0.88/1.60 725 r0(b) != c_0 # answer(prove_this). [back_rewrite(716),rewrite([724(2)]),flip(a)].
% 0.88/1.60 915 p1(A,A,A) = r0(b). [para(29(a,1),238(a,1,1)),rewrite([1(8)])].
% 0.88/1.60 965 q1(A,A,A) = r0(b). [para(39(a,1),286(a,1,1)),rewrite([1(8)])].
% 0.88/1.60 967 p2(A,A,A) = r0(b). [back_rewrite(370),rewrite([965(1),1(8)])].
% 0.88/1.60 986 r1(A) = r0(b). [para(35(a,1),312(a,1,3,1)),rewrite([965(4),1(12),1(8)])].
% 0.88/1.60 992 s1(b) = r0(b). [para(29(a,1),314(a,1,1)),rewrite([1(9)])].
% 0.88/1.60 994 ifeq(s1(A),r0(b),s1(B),r0(b)) = r0(b). [para(35(a,1),316(a,1,3,1)),rewrite([1(11)])].
% 0.88/1.60 1003 ifeq(s1(d),r0(b),ifeq(p0(A,A),r0(b),l2(B,B),r0(b)),r0(b)) = r0(b). [para(39(a,1),328(a,1,3,3,1)),rewrite([1(15)])].
% 0.88/1.60 1021 r2(c) = r0(b). [para(48(a,1),438(a,1,3,1)),rewrite([986(2),1(13),1(9)])].
% 0.88/1.60 1072 ifeq(q3(A,B),r0(b),ifeq(n3(C),r0(b),r4(C),r0(b)),r0(b)) = r0(b). [para(29(a,1),650(a,1,3,3,1)),rewrite([1(14)])].
% 0.88/1.60 1092 ifeq(r4(A),r0(b),ifeq(l4(c),r0(b),c_0,r0(b)),r0(b)) = r0(b). [para(724(a,1),712(a,1,3,3))].
% 0.88/1.60 1315 ifeq(p1(A,B,C),r1(D),n2(C),r0(b)) = r0(b). [para(986(a,2),336(a,1,2))].
% 0.88/1.60 1529 ifeq(p2(A,B,C),r1(D),n3(C),r0(b)) = r0(b). [para(986(a,2),538(a,1,2))].
% 0.88/1.60 1547 ifeq(n2(A),r1(B),p3(A,A,A),r0(b)) = r0(b). [para(986(a,2),546(a,1,2))].
% 0.88/1.60 1599 ifeq(r2(A),r1(B),ifeq(l2(C,C),r0(b),ifeq(s1(D),r0(b),q3(A,A),r0(b)),r0(b)),r0(b)) = r0(b). [para(986(a,2),574(a,1,2))].
% 0.88/1.60 1672 ifeq(p3(A,B,C),r1(D),l4(C),r0(b)) = r0(b). [para(986(a,2),610(a,1,2))].
% 0.88/1.60 1881 r1(A) != c_0 # answer(prove_this). [para(986(a,2),725(a,1))].
% 0.88/1.60 1882 r1(A) = r1(B). [para(986(a,2),986(a,2))].
% 0.88/1.60 1883 r1(A) = c_1. [new_symbol(1882)].
% 0.88/1.60 1884 c_1 != c_0 # answer(prove_this). [back_rewrite(1881),rewrite([1883(1)])].
% 0.88/1.60 2091 ifeq(p3(A,B,C),c_1,l4(C),r0(b)) = r0(b). [back_rewrite(1672),rewrite([1883(2)])].
% 0.88/1.60 2164 ifeq(r2(A),c_1,ifeq(l2(B,B),r0(b),ifeq(s1(C),r0(b),q3(A,A),r0(b)),r0(b)),r0(b)) = r0(b). [back_rewrite(1599),rewrite([1883(2)])].
% 0.88/1.60 2216 ifeq(n2(A),c_1,p3(A,A,A),r0(b)) = r0(b). [back_rewrite(1547),rewrite([1883(2)])].
% 0.88/1.60 2234 ifeq(p2(A,B,C),c_1,n3(C),r0(b)) = r0(b). [back_rewrite(1529),rewrite([1883(2)])].
% 0.88/1.60 2444 ifeq(p1(A,B,C),c_1,n2(C),r0(b)) = r0(b). [back_rewrite(1315),rewrite([1883(2)])].
% 0.88/1.60 2627 r0(b) = c_1. [back_rewrite(986),rewrite([1883(1)]),flip(a)].
% 0.88/1.60 2681 ifeq(p1(A,B,C),c_1,n2(C),c_1) = c_1. [back_rewrite(2444),rewrite([2627(5),2627(7)])].
% 0.88/1.60 2733 ifeq(p2(A,B,C),c_1,n3(C),c_1) = c_1. [back_rewrite(2234),rewrite([2627(5),2627(7)])].
% 0.88/1.60 2737 ifeq(n2(A),c_1,p3(A,A,A),c_1) = c_1. [back_rewrite(2216),rewrite([2627(5),2627(7)])].
% 0.88/1.60 2750 ifeq(r2(A),c_1,ifeq(l2(B,B),c_1,ifeq(s1(C),c_1,q3(A,A),c_1),c_1),c_1) = c_1. [back_rewrite(2164),rewrite([2627(5),2627(7),2627(9),2627(11),2627(13),2627(15)])].
% 0.88/1.60 2766 ifeq(p3(A,B,C),c_1,l4(C),c_1) = c_1. [back_rewrite(2091),rewrite([2627(5),2627(7)])].
% 0.88/1.60 2859 ifeq(r4(A),c_1,ifeq(l4(c),c_1,c_0,c_1),c_1) = c_1. [back_rewrite(1092),rewrite([2627(3),2627(6),2627(8),2627(10),2627(12)])].
% 0.88/1.60 2877 ifeq(q3(A,B),c_1,ifeq(n3(C),c_1,r4(C),c_1),c_1) = c_1. [back_rewrite(1072),rewrite([2627(3),2627(5),2627(7),2627(9),2627(11)])].
% 0.88/1.60 2923 r2(c) = c_1. [back_rewrite(1021),rewrite([2627(4)])].
% 0.88/1.60 2940 ifeq(s1(d),c_1,ifeq(p0(A,A),c_1,l2(B,B),c_1),c_1) = c_1. [back_rewrite(1003),rewrite([2627(4),2627(6),2627(8),2627(10),2627(12)])].
% 0.88/1.60 2948 ifeq(s1(A),c_1,s1(B),c_1) = c_1. [back_rewrite(994),rewrite([2627(3),2627(5),2627(7)])].
% 0.88/1.60 2950 s1(b) = c_1. [back_rewrite(992),rewrite([2627(4)])].
% 0.88/1.60 2967 p2(A,A,A) = c_1. [back_rewrite(967),rewrite([2627(3)])].
% 0.88/1.60 3002 p1(A,A,A) = c_1. [back_rewrite(915),rewrite([2627(3)])].
% 0.88/1.60 3136 p0(b,A) = c_1. [back_rewrite(29),rewrite([2627(4)])].
% 0.88/1.60 3177 s1(A) = c_1. [para(2950(a,1),2948(a,1,1)),rewrite([1(5)])].
% 0.88/1.60 3182 ifeq(p0(A,A),c_1,l2(B,B),c_1) = c_1. [back_rewrite(2940),rewrite([3177(2),1(9)])].
% 0.88/1.60 3194 ifeq(r2(A),c_1,ifeq(l2(B,B),c_1,q3(A,A),c_1),c_1) = c_1. [back_rewrite(2750),rewrite([3177(5),1(9)])].
% 0.88/1.60 3229 n2(A) = c_1. [para(3002(a,1),2681(a,1,1)),rewrite([1(5)])].
% 0.88/1.60 3234 p3(A,A,A) = c_1. [back_rewrite(2737),rewrite([3229(1),1(5)])].
% 0.88/1.60 3244 n3(A) = c_1. [para(2967(a,1),2733(a,1,1)),rewrite([1(5)])].
% 0.88/1.60 3245 ifeq(q3(A,B),c_1,r4(C),c_1) = c_1. [back_rewrite(2877),rewrite([3244(3),1(7)])].
% 0.88/1.60 3261 l4(A) = c_1. [para(3234(a,1),2766(a,1,1)),rewrite([1(5)])].
% 0.88/1.60 3267 ifeq(r4(A),c_1,c_0,c_1) = c_1. [back_rewrite(2859),rewrite([3261(4),1(7)])].
% 0.88/1.60 3461 l2(A,A) = c_1. [para(3136(a,1),3182(a,1,1)),rewrite([1(5)])].
% 0.88/1.60 3464 ifeq(r2(A),c_1,q3(A,A),c_1) = c_1. [back_rewrite(3194),rewrite([3461(3),1(7)])].
% 0.88/1.60 3477 q3(c,c) = c_1. [para(2923(a,1),3464(a,1,1)),rewrite([1(7)])].
% 0.88/1.60 3481 r4(A) = c_1. [para(3477(a,1),3245(a,1,1)),rewrite([1(5)])].
% 0.88/1.60 3483 c_1 = c_0. [back_rewrite(3267),rewrite([3481(1),1(5)]),flip(a)].
% 0.88/1.60 3484 $F # answer(prove_this). [resolve(3483,a,1884,a)].
% 0.88/1.60
% 0.88/1.60 % SZS output end Refutation
% 0.88/1.60 ============================== end of proof ==========================
% 0.88/1.60
% 0.88/1.60 ============================== STATISTICS ============================
% 0.88/1.60
% 0.88/1.60 Given=627. Generated=6165. Kept=3121. proofs=1.
% 0.88/1.60 Usable=295. Sos=318. Demods=614. Limbo=2, Disabled=2868. Hints=0.
% 0.88/1.60 Megabytes=2.81.
% 0.88/1.60 User_CPU=0.48, System_CPU=0.01, Wall_clock=0.
% 0.88/1.60
% 0.88/1.60 ============================== end of statistics =====================
% 0.88/1.60
% 0.88/1.60 ============================== end of search =========================
% 0.88/1.60
% 0.88/1.60 THEOREM PROVED
% 0.88/1.60 % SZS status Unsatisfiable
% 0.88/1.60
% 0.88/1.60 Exiting with 1 proof.
% 0.88/1.60
% 0.88/1.60 Process 29547 exit (max_proofs) Mon Jul 11 23:32:20 2022
% 0.88/1.60 Prover9 interrupted
%------------------------------------------------------------------------------