TSTP Solution File: SWV229+1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : SWV229+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof

% Computer : n024.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 : Thu Aug 31 23:03:05 EDT 2023

% Result   : Theorem 0.18s 0.57s
% Output   : Proof 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV229+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Aug 29 04:36:38 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.18/0.57  Command-line arguments: --ground-connectedness --complete-subsets
% 0.18/0.57  
% 0.18/0.57  % SZS status Theorem
% 0.18/0.57  
% 0.18/0.58  % SZS output start Proof
% 0.18/0.58  Take the following subset of the input axioms:
% 0.18/0.61    fof(quaternion_ds1_symm_0721, conjecture, (![B, A2]: ((leq(n0, A2) & (leq(n0, B) & (leq(A2, n5) & leq(B, n5)))) => a_select3(q_ds1_filter, A2, B)=a_select3(q_ds1_filter, B, A2)) & ![C, D]: ((leq(n0, C) & (leq(n0, D) & (leq(C, n2) & leq(D, n2)))) => a_select3(r_ds1_filter, C, D)=a_select3(r_ds1_filter, D, C))) => ![E, F]: ((leq(n0, E) & (leq(n0, F) & (leq(E, n5) & leq(F, n5)))) => ((~(n0=E & n5=F) & (~(n0=F & n2=E) & (~(n0=F & n3=E) & (~(n0=F & n4=E) & (~(n0=F & n5=E) & (~(n1=E & n2=F) & (~(n1=E & n3=F) & (~(n1=E & n4=F) & (~(n1=E & n5=F) & (~(n1=F & n2=E) & (~(n1=F & n3=E) & (~(n1=F & n4=E) & (~(n1=F & n5=E) & (~(n2=E & n2=F) & (~(n2=E & n3=F) & (~(n2=E & n4=F) & (~(n2=E & n5=F) & (~(n2=F & n3=E) & (~(n2=F & n4=E) & (~(n2=F & n5=E) & (~(n3=E & n3=F) & (~(n3=E & n4=F) & (~(n3=E & n5=F) & (~(n3=F & n4=E) & (~(n3=F & n5=E) & (~(n4=E & n4=F) & (~(n4=E & n5=F) & (~(n4=F & n5=E) & (~(n5=E & n5=F) & (n1=E & (n1=F & (n4=F & n5=E)))))))))))))))))))))))))))))))) => a_select2(xinit_noise, n1)=n0))).
% 0.18/0.61  
% 0.18/0.61  Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.18/0.61  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.18/0.61  We repeatedly replace C & s=t => u=v by the two clauses:
% 0.18/0.61    fresh(y, y, x1...xn) = u
% 0.18/0.61    C => fresh(s, t, x1...xn) = v
% 0.18/0.61  where fresh is a fresh function symbol and x1..xn are the free
% 0.18/0.61  variables of u and v.
% 0.18/0.61  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.18/0.61  input problem has no model of domain size 1).
% 0.18/0.61  
% 0.18/0.61  The encoding turns the above axioms into the following unit equations and goals:
% 0.18/0.61  
% 0.18/0.61  Axiom 1 (quaternion_ds1_symm_0721): n1 = f.
% 0.18/0.61  Axiom 2 (quaternion_ds1_symm_0721_2): n4 = f.
% 0.18/0.61  Axiom 3 (quaternion_ds1_symm_0721_1): n1 = e.
% 0.18/0.61  Axiom 4 (quaternion_ds1_symm_0721_3): n5 = e.
% 0.18/0.61  
% 0.18/0.61  Lemma 5: n5 = n1.
% 0.18/0.61  Proof:
% 0.18/0.61    n5
% 0.18/0.61  = { by axiom 4 (quaternion_ds1_symm_0721_3) }
% 0.18/0.61    e
% 0.18/0.61  = { by axiom 3 (quaternion_ds1_symm_0721_1) R->L }
% 0.18/0.61    n1
% 0.18/0.61  
% 0.18/0.61  Lemma 6: n4 = n1.
% 0.18/0.61  Proof:
% 0.18/0.61    n4
% 0.18/0.61  = { by axiom 2 (quaternion_ds1_symm_0721_2) }
% 0.18/0.61    f
% 0.18/0.61  = { by axiom 1 (quaternion_ds1_symm_0721) R->L }
% 0.18/0.61    n1
% 0.18/0.61  
% 0.18/0.61  Goal 1 (quaternion_ds1_symm_0721_37): tuple2(n5, n5) = tuple2(f, e).
% 0.18/0.61  Proof:
% 0.18/0.61    tuple2(n5, n5)
% 0.18/0.61  = { by lemma 5 }
% 0.18/0.61    tuple2(n1, n5)
% 0.18/0.61  = { by lemma 5 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(n1, e)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(f, e)
% 0.18/0.62  
% 0.18/0.62  Goal 2 (quaternion_ds1_symm_0721_36): tuple2(n4, n5) = tuple2(e, f).
% 0.18/0.62  Proof:
% 0.18/0.62    tuple2(n4, n5)
% 0.18/0.62  = { by lemma 6 }
% 0.18/0.62    tuple2(n1, n5)
% 0.18/0.62  = { by lemma 5 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(e, n1)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(e, f)
% 0.18/0.62  
% 0.18/0.62  Goal 3 (quaternion_ds1_symm_0721_35): tuple2(n4, n5) = tuple2(f, e).
% 0.18/0.62  Proof:
% 0.18/0.62    tuple2(n4, n5)
% 0.18/0.62  = { by lemma 6 }
% 0.18/0.62    tuple2(n1, n5)
% 0.18/0.62  = { by lemma 5 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(n1, e)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(f, e)
% 0.18/0.62  
% 0.18/0.62  Goal 4 (quaternion_ds1_symm_0721_34): tuple2(n4, n4) = tuple2(f, e).
% 0.18/0.62  Proof:
% 0.18/0.62    tuple2(n4, n4)
% 0.18/0.62  = { by lemma 6 }
% 0.18/0.62    tuple2(n1, n4)
% 0.18/0.62  = { by lemma 6 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(n1, e)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(f, e)
% 0.18/0.62  
% 0.18/0.62  Goal 5 (quaternion_ds1_symm_0721_21): tuple2(n1, n5) = tuple2(e, f).
% 0.18/0.62  Proof:
% 0.18/0.62    tuple2(n1, n5)
% 0.18/0.62  = { by lemma 5 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(e, n1)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(e, f)
% 0.18/0.62  
% 0.18/0.62  Goal 6 (quaternion_ds1_symm_0721_20): tuple2(n1, n4) = tuple2(e, f).
% 0.18/0.62  Proof:
% 0.18/0.62    tuple2(n1, n4)
% 0.18/0.62  = { by lemma 6 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(e, n1)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(e, f)
% 0.18/0.62  
% 0.18/0.62  Goal 7 (quaternion_ds1_symm_0721_17): tuple2(n1, n5) = tuple2(f, e).
% 0.18/0.62  Proof:
% 0.18/0.62    tuple2(n1, n5)
% 0.18/0.62  = { by lemma 5 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(n1, e)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(f, e)
% 0.18/0.62  
% 0.18/0.62  Goal 8 (quaternion_ds1_symm_0721_16): tuple2(n1, n4) = tuple2(f, e).
% 0.18/0.62  Proof:
% 0.18/0.62    tuple2(n1, n4)
% 0.18/0.62  = { by lemma 6 }
% 0.18/0.62    tuple2(n1, n1)
% 0.18/0.62  = { by axiom 3 (quaternion_ds1_symm_0721_1) }
% 0.18/0.62    tuple2(n1, e)
% 0.18/0.62  = { by axiom 1 (quaternion_ds1_symm_0721) }
% 0.18/0.62    tuple2(f, e)
% 0.18/0.62  % SZS output end Proof
% 0.18/0.62  
% 0.18/0.62  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------