↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWX207-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n021.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  : 300s
% DateTime : Tue May  5 07:05:25 PM UTC 2026

% Result   : Unsatisfiable 2.03s 2.20s
% Output   : Refutation 2.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   29 (  26 unt;   0 nHn;   9 RR)
%            Number of literals    :   32 (  31 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;   6 con; 0-2 aty)
%            Number of variables   :   44 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( e_q3(A,B) != bfalse
    | e_q4(c2(A,C),c2(B,D)) = bfalse ),
    file('SWX207-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( e_q2(A,B) != btrue
    | e_q(cons(A,C),cons(B,D)) = e_q(C,D) ),
    file('SWX207-1.p',unknown),
    [] ).

cnf(5,axiom,
    e_q5(unambig(A,B),bfalse) != btrue,
    file('SWX207-1.p',unknown),
    [] ).

cnf(6,axiom,
    A = A,
    file('SWX207-1.p',unknown),
    [] ).

cnf(8,axiom,
    impl(btrue,A) = A,
    file('SWX207-1.p',unknown),
    [] ).

cnf(12,axiom,
    append(nil,A) = A,
    file('SWX207-1.p',unknown),
    [] ).

cnf(13,axiom,
    append(cons(A,B),C) = cons(A,append(B,C)),
    file('SWX207-1.p',unknown),
    [] ).

cnf(14,plain,
    cons(A,append(B,C)) = append(cons(A,B),C),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13])]),
    [iquote('copy,13,flip.1')] ).

cnf(22,axiom,
    linP(pB) = cons(b,nil),
    file('SWX207-1.p',unknown),
    [] ).

cnf(24,axiom,
    linP(pE) = nil,
    file('SWX207-1.p',unknown),
    [] ).

cnf(26,axiom,
    linC(c2(A,B)) = append(linP(A),linP(B)),
    file('SWX207-1.p',unknown),
    [] ).

cnf(27,axiom,
    unambig(A,B) = impl(e_q(linC(A),linC(B)),e_q4(A,B)),
    file('SWX207-1.p',unknown),
    [] ).

cnf(38,axiom,
    e_q3(pB,pE) = bfalse,
    file('SWX207-1.p',unknown),
    [] ).

cnf(81,axiom,
    e_q(A,A) = btrue,
    file('SWX207-1.p',unknown),
    [] ).

cnf(82,axiom,
    e_q2(A,A) = btrue,
    file('SWX207-1.p',unknown),
    [] ).

cnf(89,axiom,
    e_q5(A,A) = btrue,
    file('SWX207-1.p',unknown),
    [] ).

cnf(94,plain,
    append(linP(A),linP(B)) = linC(c2(A,B)),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[26])]),
    [iquote('copy,26,flip.1')] ).

cnf(95,plain,
    impl(e_q(linC(A),linC(B)),e_q4(A,B)) = unambig(A,B),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[27])]),
    [iquote('copy,27,flip.1')] ).

cnf(100,plain,
    ( e_q2(A,B) != btrue
    | e_q(append(cons(A,C),D),cons(B,E)) = e_q(append(C,D),E) ),
    inference(para_from,[status(thm),theory(equality)],[14,4]),
    [iquote('para_from,14.1.1,4.2.1.1')] ).

cnf(115,plain,
    e_q4(c2(pB,A),c2(pE,B)) = bfalse,
    inference(hyper,[status(thm)],[38,1]),
    [iquote('hyper,38,1')] ).

cnf(162,plain,
    linP(A) = linC(c2(pE,A)),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[94,24]),12]),
    [iquote('para_into,94.1.1.1,24.1.1,demod,12')] ).

cnf(171,plain,
    append(linC(c2(pE,A)),nil) = linC(c2(A,pE)),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[94,24]),162]),
    [iquote('para_into,94.1.1.2,24.1.1,demod,162')] ).

cnf(180,plain,
    linC(c2(pE,pB)) = cons(b,nil),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[22]),162]),
    [iquote('back_demod,22,demod,162')] ).

cnf(205,plain,
    impl(e_q(linC(A),cons(b,nil)),e_q4(A,c2(pE,pB))) = unambig(A,c2(pE,pB)),
    inference(para_from,[status(thm),theory(equality)],[180,95]),
    [iquote('para_from,180.1.1,95.1.1.1.2')] ).

cnf(271,plain,
    e_q(append(cons(A,B),C),cons(A,D)) = e_q(append(B,C),D),
    inference(hyper,[status(thm)],[100,82]),
    [iquote('hyper,100,82')] ).

cnf(331,plain,
    linC(c2(pB,pE)) = append(cons(b,nil),nil),
    inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[171,180])]),
    [iquote('para_into,171.1.1.1,180.1.1,flip.1')] ).

cnf(664,plain,
    unambig(c2(pB,pE),c2(pE,pB)) = bfalse,
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[205,331]),271,12,81,115,8])]),
    [iquote('para_into,205.1.1.1.1,331.1.1,demod,271,12,81,115,8,flip.1')] ).

cnf(676,plain,
    btrue != btrue,
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[664,5]),89]),
    [iquote('para_from,664.1.1,5.1.1.1,demod,89')] ).

cnf(677,plain,
    $false,
    inference(binary,[status(thm)],[676,6]),
    [iquote('binary,676.1,6.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWX207-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12  % Command  : otter-tptp-script %s
% 0.16/0.33  % Computer : n021.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit : 300
% 0.16/0.33  % WCLimit  : 300
% 0.16/0.33  % DateTime : Tue May  5 11:37:25 EDT 2026
% 0.16/0.33  % CPUTime  : 
% 1.97/2.17  ----- Otter 3.3f, August 2004 -----
% 1.97/2.17  The process was started by sandbox2 on n021.cluster.edu,
% 1.97/2.17  Tue May  5 11:37:25 2026
% 1.97/2.17  The command was "./otter".  The process ID is 19231.
% 1.97/2.17  
% 1.97/2.17  set(prolog_style_variables).
% 1.97/2.17  set(auto).
% 1.97/2.17     dependent: set(auto1).
% 1.97/2.17     dependent: set(process_input).
% 1.97/2.17     dependent: clear(print_kept).
% 1.97/2.17     dependent: clear(print_new_demod).
% 1.97/2.17     dependent: clear(print_back_demod).
% 1.97/2.17     dependent: clear(print_back_sub).
% 1.97/2.17     dependent: set(control_memory).
% 1.97/2.17     dependent: assign(max_mem, 12000).
% 1.97/2.17     dependent: assign(pick_given_ratio, 4).
% 1.97/2.17     dependent: assign(stats_level, 1).
% 1.97/2.17     dependent: assign(max_seconds, 10800).
% 1.97/2.17  clear(print_given).
% 1.97/2.17  
% 1.97/2.17  list(usable).
% 1.97/2.17  0 [] A=A.
% 1.97/2.17  0 [] impl(btrue,Q)=Q.
% 1.97/2.17  0 [] impl(bfalse,Q)=btrue.
% 1.97/2.17  0 [] append(nil,Y)=Y.
% 1.97/2.17  0 [] append(cons(Z,Xs),Y)=cons(Z,append(Xs,Y)).
% 1.97/2.17  0 [] linP(aP(P))=append(cons(a,nil),append(linP(P),cons(a,nil))).
% 1.97/2.17  0 [] linP(bP(Q))=append(cons(b,nil),append(linP(Q),cons(b,nil))).
% 1.97/2.17  0 [] linP(pA)=cons(a,nil).
% 1.97/2.17  0 [] linP(pB)=cons(b,nil).
% 1.97/2.17  0 [] linP(pE)=nil.
% 1.97/2.17  0 [] linC(c2(P,Q))=append(linP(P),linP(Q)).
% 1.97/2.17  0 [] unambig(X,Y)=impl(e_q(linC(X),linC(Y)),e_q4(X,Y)).
% 1.97/2.17  0 [] e_q2(a,b)=bfalse.
% 1.97/2.17  0 [] e_q2(b,a)=bfalse.
% 1.97/2.17  0 [] e_q3(pA,pB)=bfalse.
% 1.97/2.17  0 [] e_q3(pA,pE)=bfalse.
% 1.97/2.17  0 [] e_q3(pB,pA)=bfalse.
% 1.97/2.17  0 [] e_q3(pB,pE)=bfalse.
% 1.97/2.17  0 [] e_q3(pE,pA)=bfalse.
% 1.97/2.17  0 [] e_q3(pE,pB)=bfalse.
% 1.97/2.17  0 [] e_q5(bfalse,btrue)=bfalse.
% 1.97/2.17  0 [] e_q5(btrue,bfalse)=bfalse.
% 1.97/2.17  0 [] e_q3(aP(X),aP(Y))=e_q3(X,Y).
% 1.97/2.17  0 [] e_q3(bP(X),bP(Y))=e_q3(X,Y).
% 1.97/2.17  0 [] e_q3(aP(X),bP(Y))=bfalse.
% 1.97/2.17  0 [] e_q3(aP(X),pA)=bfalse.
% 1.97/2.17  0 [] e_q3(aP(X),pB)=bfalse.
% 1.97/2.17  0 [] e_q3(aP(X),pE)=bfalse.
% 1.97/2.17  0 [] e_q3(bP(X),aP(Y))=bfalse.
% 1.97/2.17  0 [] e_q3(bP(X),pA)=bfalse.
% 1.97/2.17  0 [] e_q3(bP(X),pB)=bfalse.
% 1.97/2.17  0 [] e_q3(bP(X),pE)=bfalse.
% 1.97/2.17  0 [] e_q3(pA,aP(X))=bfalse.
% 1.97/2.17  0 [] e_q3(pA,bP(X))=bfalse.
% 1.97/2.17  0 [] e_q3(pB,aP(X))=bfalse.
% 1.97/2.17  0 [] e_q3(pB,bP(X))=bfalse.
% 1.97/2.17  0 [] e_q3(pE,aP(X))=bfalse.
% 1.97/2.17  0 [] e_q3(pE,bP(X))=bfalse.
% 1.97/2.17  0 [] e_q3(X,Z)!=bfalse|e_q4(c2(X,Y),c2(Z,X2))=bfalse.
% 1.97/2.17  0 [] e_q3(X,Z)!=btrue|e_q4(c2(X,Y),c2(Z,X2))=e_q3(Y,X2).
% 1.97/2.17  0 [] e_q(X,X)=btrue.
% 1.97/2.17  0 [] e_q2(X,X)=btrue.
% 1.97/2.17  0 [] e_q3(X,X)=btrue.
% 1.97/2.17  0 [] e_q4(X,X)=btrue.
% 1.97/2.17  0 [] e_q5(X,X)=btrue.
% 1.97/2.17  0 [] e_q2(X,Z)!=bfalse|e_q(cons(X,Y),cons(Z,X2))=bfalse.
% 1.97/2.17  0 [] e_q2(X,Z)!=btrue|e_q(cons(X,Y),cons(Z,X2))=e_q(Y,X2).
% 1.97/2.17  0 [] e_q(nil,cons(X,Y))=bfalse.
% 1.97/2.17  0 [] e_q(cons(X,Y),nil)=bfalse.
% 1.97/2.17  0 [] e_q5(unambig(X,Y),bfalse)!=btrue.
% 1.97/2.17  end_of_list.
% 1.97/2.17  
% 1.97/2.17  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.97/2.17  
% 1.97/2.17  This is a Horn set with equality.  The strategy will be
% 1.97/2.17  Knuth-Bendix and hyper_res, with positive clauses in
% 1.97/2.17  sos and nonpositive clauses in usable.
% 1.97/2.17  
% 1.97/2.17     dependent: set(knuth_bendix).
% 1.97/2.17     dependent: set(anl_eq).
% 1.97/2.17     dependent: set(para_from).
% 1.97/2.17     dependent: set(para_into).
% 1.97/2.17     dependent: clear(para_from_right).
% 1.97/2.17     dependent: clear(para_into_right).
% 1.97/2.17     dependent: set(para_from_vars).
% 1.97/2.17     dependent: set(eq_units_both_ways).
% 1.97/2.17     dependent: set(dynamic_demod_all).
% 1.97/2.17     dependent: set(dynamic_demod).
% 1.97/2.17     dependent: set(order_eq).
% 1.97/2.17     dependent: set(back_demod).
% 1.97/2.17     dependent: set(lrpo).
% 1.97/2.17     dependent: set(hyper_res).
% 1.97/2.17     dependent: clear(order_hyper).
% 1.97/2.17  
% 1.97/2.17  ------------> process usable:
% 1.97/2.17  ** KEPT (pick-wt=14): 1 [] e_q3(A,B)!=bfalse|e_q4(c2(A,C),c2(B,D))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=16): 2 [] e_q3(A,B)!=btrue|e_q4(c2(A,C),c2(B,D))=e_q3(C,D).
% 1.97/2.17  ** KEPT (pick-wt=14): 3 [] e_q2(A,B)!=bfalse|e_q(cons(A,C),cons(B,D))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=16): 4 [] e_q2(A,B)!=btrue|e_q(cons(A,C),cons(B,D))=e_q(C,D).
% 1.97/2.17  ** KEPT (pick-wt=7): 5 [] e_q5(unambig(A,B),bfalse)!=btrue.
% 1.97/2.17  
% 1.97/2.17  ------------> process sos:
% 1.97/2.17  ** KEPT (pick-wt=3): 6 [] A=A.
% 1.97/2.17  ** KEPT (pick-wt=5): 7 [] impl(btrue,A)=A.
% 1.97/2.17  ---> New Demodulator: 8 [new_demod,7] impl(btrue,A)=A.
% 1.97/2.17  ** KEPT (pick-wt=5): 9 [] impl(bfalse,A)=btrue.
% 1.97/2.17  ---> New Demodulator: 10 [new_demod,9] impl(bfalse,A)=btrue.
% 1.97/2.17  ** KEPT (pick-wt=5): 11 [] append(nil,A)=A.
% 1.97/2.17  ---> New Demodulator: 12 [new_demod,11] append(nil,A)=A.
% 1.97/2.17  ** KEPT (pick-wt=11): 14 [copy,13,flip.1] cons(A,append(B,C))=append(cons(A,B),C).
% 1.97/2.17  ---> New Demodulator: 15 [new_demod,14] cons(A,append(B,C))=append(cons(A,B),C).
% 1.97/2.17  ** KEPT (pick-wt=14): 16 [] linP(aP(A))=append(cons(a,nil),append(linP(A),cons(a,nil))).
% 1.97/2.17  ---> New Demodulator: 17 [new_demod,16] linP(aP(A))=append(cons(a,nil),append(linP(A),cons(a,nil))).
% 1.97/2.17  ** KEPT (pick-wt=14): 18 [] linP(bP(A))=append(cons(b,nil),append(linP(A),cons(b,nil))).
% 1.97/2.17  ---> New Demodulator: 19 [new_demod,18] linP(bP(A))=append(cons(b,nil),append(linP(A),cons(b,nil))).
% 1.97/2.17  ** KEPT (pick-wt=6): 20 [] linP(pA)=cons(a,nil).
% 1.97/2.17  ---> New Demodulator: 21 [new_demod,20] linP(pA)=cons(a,nil).
% 1.97/2.17  ** KEPT (pick-wt=6): 22 [] linP(pB)=cons(b,nil).
% 1.97/2.17  ---> New Demodulator: 23 [new_demod,22] linP(pB)=cons(b,nil).
% 1.97/2.17  ** KEPT (pick-wt=4): 24 [] linP(pE)=nil.
% 1.97/2.17  ---> New Demodulator: 25 [new_demod,24] linP(pE)=nil.
% 1.97/2.17  ** KEPT (pick-wt=10): 26 [] linC(c2(A,B))=append(linP(A),linP(B)).
% 1.97/2.17  ** KEPT (pick-wt=13): 27 [] unambig(A,B)=impl(e_q(linC(A),linC(B)),e_q4(A,B)).
% 1.97/2.17  ** KEPT (pick-wt=5): 28 [] e_q2(a,b)=bfalse.
% 1.97/2.17  ---> New Demodulator: 29 [new_demod,28] e_q2(a,b)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 30 [] e_q2(b,a)=bfalse.
% 1.97/2.17  ---> New Demodulator: 31 [new_demod,30] e_q2(b,a)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 32 [] e_q3(pA,pB)=bfalse.
% 1.97/2.17  ---> New Demodulator: 33 [new_demod,32] e_q3(pA,pB)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 34 [] e_q3(pA,pE)=bfalse.
% 1.97/2.17  ---> New Demodulator: 35 [new_demod,34] e_q3(pA,pE)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 36 [] e_q3(pB,pA)=bfalse.
% 1.97/2.17  ---> New Demodulator: 37 [new_demod,36] e_q3(pB,pA)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 38 [] e_q3(pB,pE)=bfalse.
% 1.97/2.17  ---> New Demodulator: 39 [new_demod,38] e_q3(pB,pE)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 40 [] e_q3(pE,pA)=bfalse.
% 1.97/2.17  ---> New Demodulator: 41 [new_demod,40] e_q3(pE,pA)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 42 [] e_q3(pE,pB)=bfalse.
% 1.97/2.17  ---> New Demodulator: 43 [new_demod,42] e_q3(pE,pB)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 44 [] e_q5(bfalse,btrue)=bfalse.
% 1.97/2.17  ---> New Demodulator: 45 [new_demod,44] e_q5(bfalse,btrue)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 46 [] e_q5(btrue,bfalse)=bfalse.
% 1.97/2.17  ---> New Demodulator: 47 [new_demod,46] e_q5(btrue,bfalse)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=9): 48 [] e_q3(aP(A),aP(B))=e_q3(A,B).
% 1.97/2.17  ---> New Demodulator: 49 [new_demod,48] e_q3(aP(A),aP(B))=e_q3(A,B).
% 1.97/2.17  ** KEPT (pick-wt=9): 50 [] e_q3(bP(A),bP(B))=e_q3(A,B).
% 1.97/2.17  ---> New Demodulator: 51 [new_demod,50] e_q3(bP(A),bP(B))=e_q3(A,B).
% 1.97/2.17  ** KEPT (pick-wt=7): 52 [] e_q3(aP(A),bP(B))=bfalse.
% 1.97/2.17  ---> New Demodulator: 53 [new_demod,52] e_q3(aP(A),bP(B))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 54 [] e_q3(aP(A),pA)=bfalse.
% 1.97/2.17  ---> New Demodulator: 55 [new_demod,54] e_q3(aP(A),pA)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 56 [] e_q3(aP(A),pB)=bfalse.
% 1.97/2.17  ---> New Demodulator: 57 [new_demod,56] e_q3(aP(A),pB)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 58 [] e_q3(aP(A),pE)=bfalse.
% 1.97/2.17  ---> New Demodulator: 59 [new_demod,58] e_q3(aP(A),pE)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=7): 60 [] e_q3(bP(A),aP(B))=bfalse.
% 1.97/2.17  ---> New Demodulator: 61 [new_demod,60] e_q3(bP(A),aP(B))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 62 [] e_q3(bP(A),pA)=bfalse.
% 1.97/2.17  ---> New Demodulator: 63 [new_demod,62] e_q3(bP(A),pA)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 64 [] e_q3(bP(A),pB)=bfalse.
% 1.97/2.17  ---> New Demodulator: 65 [new_demod,64] e_q3(bP(A),pB)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 66 [] e_q3(bP(A),pE)=bfalse.
% 1.97/2.17  ---> New Demodulator: 67 [new_demod,66] e_q3(bP(A),pE)=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 68 [] e_q3(pA,aP(A))=bfalse.
% 1.97/2.17  ---> New Demodulator: 69 [new_demod,68] e_q3(pA,aP(A))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 70 [] e_q3(pA,bP(A))=bfalse.
% 1.97/2.17  ---> New Demodulator: 71 [new_demod,70] e_q3(pA,bP(A))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 72 [] e_q3(pB,aP(A))=bfalse.
% 1.97/2.17  ---> New Demodulator: 73 [new_demod,72] e_q3(pB,aP(A))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 74 [] e_q3(pB,bP(A))=bfalse.
% 1.97/2.17  ---> New Demodulator: 75 [new_demod,74] e_q3(pB,bP(A))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 76 [] e_q3(pE,aP(A))=bfalse.
% 1.97/2.17  ---> New Demodulator: 77 [new_demod,76] e_q3(pE,aP(A))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=6): 78 [] e_q3(pE,bP(A))=bfalse.
% 1.97/2.17  ---> New Demodulator: 79 [new_demod,78] e_q3(pE,bP(A))=bfalse.
% 1.97/2.17  ** KEPT (pick-wt=5): 80 [] e_q(A,A)=btrue.
% 1.97/2.17  ---> New Demodulator: 81 [new_demod,80] e_q(A,A)=btrue.
% 1.97/2.17  ** KEPT (pick-wt=5): 82 [] e_q2(A,A)=btrue.
% 1.97/2.17  ---> New Demodulator: 83 [new_demod,82] e_q2(A,A)=btrue.
% 1.97/2.17  ** KEPT (pick-wt=5): 84 [] e_q3(A,A)=btrue.
% 1.97/2.17  ---> New Demodulator: 85 [new_demod,84] e_q3(A,A)=btrue.
% 1.97/2.17  ** KEPT (pick-wt=5): 86 [] e_q4(A,A)=btrue.
% 1.97/2.17  ---> New Demodulator: 87 [new_demod,86] e_q4(A,A)=btrue.
% 1.97/2.17  ** KEPT (pick-wt=5): 88 [] e_q5(A,A)=btrue.
% 1.97/2.17  ---> New Demodulator: 89 [new_demod,88] e_q5(A,A)=btrue.
% 1.97/2.17  ** KEPT (pick-wt=7): 90 [] e_q(nil,cons(A,B))=bfalse.
% 2.03/2.20  ---> New Demodulator: 91 [new_demod,90] e_q(nil,cons(A,B))=bfalse.
% 2.03/2.20  ** KEPT (pick-wt=7): 92 [] e_q(cons(A,B),nil)=bfalse.
% 2.03/2.20  ---> New Demodulator: 93 [new_demod,92] e_q(cons(A,B),nil)=bfalse.
% 2.03/2.20    Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] A=A.
% 2.03/2.20  >>>> Starting back demodulation with 8.
% 2.03/2.20  >>>> Starting back demodulation with 10.
% 2.03/2.20  >>>> Starting back demodulation with 12.
% 2.03/2.20  >>>> Starting back demodulation with 15.
% 2.03/2.20  >>>> Starting back demodulation with 17.
% 2.03/2.20  >>>> Starting back demodulation with 19.
% 2.03/2.20  >>>> Starting back demodulation with 21.
% 2.03/2.20  >>>> Starting back demodulation with 23.
% 2.03/2.20  >>>> Starting back demodulation with 25.
% 2.03/2.20  ** KEPT (pick-wt=10): 94 [copy,26,flip.1] append(linP(A),linP(B))=linC(c2(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=13): 95 [copy,27,flip.1] impl(e_q(linC(A),linC(B)),e_q4(A,B))=unambig(A,B).
% 2.03/2.20  >>>> Starting back demodulation with 29.
% 2.03/2.20  >>>> Starting back demodulation with 31.
% 2.03/2.20  >>>> Starting back demodulation with 33.
% 2.03/2.20  >>>> Starting back demodulation with 35.
% 2.03/2.20  >>>> Starting back demodulation with 37.
% 2.03/2.20  >>>> Starting back demodulation with 39.
% 2.03/2.20  >>>> Starting back demodulation with 41.
% 2.03/2.20  >>>> Starting back demodulation with 43.
% 2.03/2.20  >>>> Starting back demodulation with 45.
% 2.03/2.20  >>>> Starting back demodulation with 47.
% 2.03/2.20  >>>> Starting back demodulation with 49.
% 2.03/2.20  >>>> Starting back demodulation with 51.
% 2.03/2.20  >>>> Starting back demodulation with 53.
% 2.03/2.20  >>>> Starting back demodulation with 55.
% 2.03/2.20  >>>> Starting back demodulation with 57.
% 2.03/2.20  >>>> Starting back demodulation with 59.
% 2.03/2.20  >>>> Starting back demodulation with 61.
% 2.03/2.20  >>>> Starting back demodulation with 63.
% 2.03/2.20  >>>> Starting back demodulation with 65.
% 2.03/2.20  >>>> Starting back demodulation with 67.
% 2.03/2.20  >>>> Starting back demodulation with 69.
% 2.03/2.20  >>>> Starting back demodulation with 71.
% 2.03/2.20  >>>> Starting back demodulation with 73.
% 2.03/2.20  >>>> Starting back demodulation with 75.
% 2.03/2.20  >>>> Starting back demodulation with 77.
% 2.03/2.20  >>>> Starting back demodulation with 79.
% 2.03/2.20  >>>> Starting back demodulation with 81.
% 2.03/2.20  >>>> Starting back demodulation with 83.
% 2.03/2.20  >>>> Starting back demodulation with 85.
% 2.03/2.20  >>>> Starting back demodulation with 87.
% 2.03/2.20  >>>> Starting back demodulation with 89.
% 2.03/2.20  >>>> Starting back demodulation with 91.
% 2.03/2.20  >>>> Starting back demodulation with 93.
% 2.03/2.20    Following clause subsumed by 26 during input processing: 0 [copy,94,flip.1] linC(c2(A,B))=append(linP(A),linP(B)).
% 2.03/2.20    Following clause subsumed by 27 during input processing: 0 [copy,95,flip.1] unambig(A,B)=impl(e_q(linC(A),linC(B)),e_q4(A,B)).
% 2.03/2.20  
% 2.03/2.20  ======= end of input processing =======
% 2.03/2.20  
% 2.03/2.20  =========== start of search ===========
% 2.03/2.20  
% 2.03/2.20  
% 2.03/2.20  Resetting weight limit to 12.
% 2.03/2.20  
% 2.03/2.20  
% 2.03/2.20  Resetting weight limit to 12.
% 2.03/2.20  
% 2.03/2.20  sos_size=225
% 2.03/2.20  
% 2.03/2.20  -------- PROOF -------- 
% 2.03/2.20  
% 2.03/2.20  ----> UNIT CONFLICT at   0.03 sec ----> 677 [binary,676.1,6.1] $F.
% 2.03/2.20  
% 2.03/2.20  Length of proof is 13.  Level of proof is 6.
% 2.03/2.20  
% 2.03/2.20  ---------------- PROOF ----------------
% 2.03/2.20  % SZS status Unsatisfiable
% 2.03/2.20  % SZS output start Refutation
% See solution above
% 2.03/2.21  ------------ end of proof -------------
% 2.03/2.21  
% 2.03/2.21  
% 2.03/2.21  Search stopped by max_proofs option.
% 2.03/2.21  
% 2.03/2.21  
% 2.03/2.21  Search stopped by max_proofs option.
% 2.03/2.21  
% 2.03/2.21  ============ end of search ============
% 2.03/2.21  
% 2.03/2.21  -------------- statistics -------------
% 2.03/2.21  clauses given                214
% 2.03/2.21  clauses generated           2413
% 2.03/2.21  clauses kept                 437
% 2.03/2.21  clauses forward subsumed    1334
% 2.03/2.21  clauses back subsumed          8
% 2.03/2.21  Kbytes malloced             4882
% 2.03/2.21  
% 2.03/2.21  ----------- times (seconds) -----------
% 2.03/2.21  user CPU time          0.03          (0 hr, 0 min, 0 sec)
% 2.03/2.21  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 2.03/2.21  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.03/2.21  
% 2.03/2.21  That finishes the proof of the theorem.
% 2.03/2.21  
% 2.03/2.21  Process 19231 finished Tue May  5 11:37:27 2026
% 2.03/2.21  Otter interrupted
% 2.03/2.21  PROOF FOUND
%------------------------------------------------------------------------------