%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : FLD007-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% 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  : 300s
% DateTime : Wed May 29 16:43:48 EDT 2024

% Result   : Unsatisfiable 0.36s 0.56s
% Output   : Proof 0.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : FLD007-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.04/0.15  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n010.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sun May 26 07:35:39 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.52  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.36/0.56  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.ZEMrVrRhF4/cvc5---1.0.5_1253.smt2
% 0.36/0.56  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.ZEMrVrRhF4/cvc5---1.0.5_1253.smt2
% 0.39/0.57  (assume a0 (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))))
% 0.39/0.57  (assume a1 (forall ((U $$unsorted) (Z $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (V $$unsorted)) (or (tptp.sum U Z W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum X V W)))))
% 0.39/0.57  (assume a2 (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))))
% 0.39/0.57  (assume a3 (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))))
% 0.39/0.57  (assume a4 (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))))
% 0.39/0.57  (assume a5 (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.product X V W) (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)))))
% 0.39/0.57  (assume a6 (forall ((U $$unsorted) (Z $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (V $$unsorted)) (or (tptp.product U Z W) (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)))))
% 0.39/0.57  (assume a7 (forall ((X $$unsorted)) (or (tptp.product tptp.multiplicative_identity X X) (not (tptp.defined X)))))
% 0.39/0.57  (assume a8 (forall ((X $$unsorted)) (or (tptp.product (tptp.multiplicative_inverse X) X tptp.multiplicative_identity) (tptp.sum tptp.additive_identity X tptp.additive_identity) (not (tptp.defined X)))))
% 0.39/0.57  (assume a9 (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.product Y X Z) (not (tptp.product X Y Z)))))
% 0.39/0.57  (assume a10 (forall ((C $$unsorted) (D $$unsorted) (B $$unsorted) (X $$unsorted) (Y $$unsorted) (A $$unsorted) (Z $$unsorted)) (or (tptp.sum C D B) (not (tptp.sum X Y A)) (not (tptp.product A Z B)) (not (tptp.product X Z C)) (not (tptp.product Y Z D)))))
% 0.39/0.57  (assume a11 (forall ((A $$unsorted) (Z $$unsorted) (B $$unsorted) (X $$unsorted) (Y $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.product A Z B) (not (tptp.sum X Y A)) (not (tptp.product X Z C)) (not (tptp.product Y Z D)) (not (tptp.sum C D B)))))
% 0.39/0.57  (assume a12 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.defined (tptp.add X Y)) (not (tptp.defined X)) (not (tptp.defined Y)))))
% 0.39/0.57  (assume a13 (tptp.defined tptp.additive_identity))
% 0.39/0.57  (assume a14 (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))))
% 0.39/0.57  (assume a15 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.defined (tptp.multiply X Y)) (not (tptp.defined X)) (not (tptp.defined Y)))))
% 0.39/0.57  (assume a16 (tptp.defined tptp.multiplicative_identity))
% 0.39/0.57  (assume a17 (forall ((X $$unsorted)) (or (tptp.defined (tptp.multiplicative_inverse X)) (not (tptp.defined X)) (tptp.sum tptp.additive_identity X tptp.additive_identity))))
% 0.39/0.57  (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.sum X Y (tptp.add X Y)) (not (tptp.defined X)) (not (tptp.defined Y)))))
% 0.39/0.57  (assume a19 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.product X Y (tptp.multiply X Y)) (not (tptp.defined X)) (not (tptp.defined Y)))))
% 0.39/0.57  (assume a20 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.sum tptp.additive_identity X Y) (not (tptp.less_or_equal X Y)) (not (tptp.less_or_equal Y X)))))
% 0.39/0.57  (assume a21 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.less_or_equal X Z) (not (tptp.less_or_equal X Y)) (not (tptp.less_or_equal Y Z)))))
% 0.39/0.57  (assume a22 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.less_or_equal X Y) (tptp.less_or_equal Y X) (not (tptp.defined X)) (not (tptp.defined Y)))))
% 0.39/0.57  (assume a23 (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (tptp.less_or_equal U V) (not (tptp.less_or_equal X Y)) (not (tptp.sum X Z U)) (not (tptp.sum Y Z V)))))
% 0.39/0.57  (assume a24 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.less_or_equal tptp.additive_identity Z) (not (tptp.less_or_equal tptp.additive_identity X)) (not (tptp.less_or_equal tptp.additive_identity Y)) (not (tptp.product X Y Z)))))
% 0.39/0.57  (assume a25 (not (tptp.sum tptp.additive_identity tptp.additive_identity tptp.multiplicative_identity)))
% 0.39/0.57  (assume a26 (tptp.defined tptp.a))
% 0.39/0.57  (assume a27 (not (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a)))
% 0.39/0.57  (step t1 (cl (=> (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W))))) :rule implies_neg1)
% 0.39/0.57  (anchor :step t2)
% 0.39/0.57  (assume t2.a0 (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))))
% 0.39/0.57  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a))))) :rule forall_inst :args ((:= X (tptp.additive_inverse (tptp.additive_inverse tptp.a))) (:= V tptp.additive_identity) (:= W tptp.a) (:= Y (tptp.additive_inverse tptp.a)) (:= U tptp.additive_identity) (:= Z tptp.a)))
% 0.39/0.57  (step t2.t2 (cl (not (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) :rule or :premises (t2.t1))
% 0.39/0.57  (step t2.t3 (cl (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.39/0.57  (step t2 (cl (not (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) :rule subproof :discharge (t2.a0))
% 0.39/0.57  (step t3 (cl (=> (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) :rule resolution :premises (t1 t2))
% 0.39/0.57  (step t4 (cl (=> (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) (not (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a))))) :rule implies_neg2)
% 0.39/0.57  (step t5 (cl (=> (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) (=> (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a))))) :rule resolution :premises (t3 t4))
% 0.39/0.57  (step t6 (cl (=> (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a))))) :rule contraction :premises (t5))
% 0.39/0.57  (step t7 (cl (not (forall ((X $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted)) (or (tptp.sum X V W) (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) :rule implies :premises (t6))
% 0.39/0.57  (step t8 (cl (not (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)))) (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a))) :rule or_pos)
% 0.39/0.57  (step t9 (cl (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum tptp.additive_identity tptp.a tptp.a)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a))))) :rule reordering :premises (t8))
% 0.39/0.57  (step t10 (cl (not (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a))) :rule or_pos)
% 0.39/0.57  (step t11 (cl (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)) (not (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a))))) :rule reordering :premises (t10))
% 0.39/0.57  (step t12 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z))))) :rule implies_neg1)
% 0.39/0.57  (anchor :step t13)
% 0.39/0.57  (assume t13.a0 (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))))
% 0.39/0.57  (step t13.t1 (cl (or (not (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z))))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a))))) :rule forall_inst :args ((:= Y tptp.additive_identity) (:= X (tptp.additive_inverse (tptp.additive_inverse tptp.a))) (:= Z tptp.a)))
% 0.39/0.57  (step t13.t2 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z))))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) :rule or :premises (t13.t1))
% 0.39/0.57  (step t13.t3 (cl (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) :rule resolution :premises (t13.t2 t13.a0))
% 0.39/0.57  (step t13 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z))))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) :rule subproof :discharge (t13.a0))
% 0.39/0.57  (step t14 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) :rule resolution :premises (t12 t13))
% 0.39/0.57  (step t15 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) (not (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a))))) :rule implies_neg2)
% 0.39/0.57  (step t16 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) (=> (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a))))) :rule resolution :premises (t14 t15))
% 0.39/0.57  (step t17 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z)))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a))))) :rule contraction :premises (t16))
% 0.39/0.57  (step t18 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (tptp.sum Y X Z) (not (tptp.sum X Y Z))))) (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) :rule implies :premises (t17))
% 0.39/0.57  (step t19 (cl (or (tptp.sum tptp.additive_identity (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a)))) :rule resolution :premises (t18 a4))
% 0.39/0.57  (step t20 (cl (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a))) :rule resolution :premises (t11 a27 t19))
% 0.39/0.57  (step t21 (cl (not (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a))) :rule or_pos)
% 0.39/0.57  (step t22 (cl (not (tptp.defined tptp.a)) (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a))))) :rule reordering :premises (t21))
% 0.39/0.57  (step t23 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X))))) :rule implies_neg1)
% 0.39/0.57  (anchor :step t24)
% 0.39/0.57  (assume t24.a0 (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))))
% 0.39/0.57  (step t24.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X))))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.39/0.57  (step t24.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X))))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) :rule or :premises (t24.t1))
% 0.39/0.57  (step t24.t3 (cl (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) :rule resolution :premises (t24.t2 t24.a0))
% 0.39/0.57  (step t24 (cl (not (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X))))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) :rule subproof :discharge (t24.a0))
% 0.39/0.57  (step t25 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) :rule resolution :premises (t23 t24))
% 0.39/0.57  (step t26 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) (not (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a))))) :rule implies_neg2)
% 0.39/0.57  (step t27 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) (=> (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a))))) :rule resolution :premises (t25 t26))
% 0.39/0.57  (step t28 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X)))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a))))) :rule contraction :premises (t27))
% 0.39/0.57  (step t29 (cl (not (forall ((X $$unsorted)) (or (tptp.sum tptp.additive_identity X X) (not (tptp.defined X))))) (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) :rule implies :premises (t28))
% 0.39/0.57  (step t30 (cl (or (tptp.sum tptp.additive_identity tptp.a tptp.a) (not (tptp.defined tptp.a)))) :rule resolution :premises (t29 a2))
% 0.39/0.57  (step t31 (cl (tptp.sum tptp.additive_identity tptp.a tptp.a)) :rule resolution :premises (t22 a26 t30))
% 0.39/0.57  (step t32 (cl (not (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a))) :rule or_pos)
% 0.39/0.57  (step t33 (cl (not (tptp.defined tptp.a)) (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a))))) :rule reordering :premises (t32))
% 0.39/0.57  (step t34 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) :rule implies_neg1)
% 0.39/0.57  (anchor :step t35)
% 0.39/0.57  (assume t35.a0 (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))))
% 0.39/0.57  (step t35.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.39/0.57  (step t35.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) :rule or :premises (t35.t1))
% 0.39/0.57  (step t35.t3 (cl (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) :rule resolution :premises (t35.t2 t35.a0))
% 0.39/0.57  (step t35 (cl (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) :rule subproof :discharge (t35.a0))
% 0.39/0.57  (step t36 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) :rule resolution :premises (t34 t35))
% 0.39/0.57  (step t37 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) (not (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a))))) :rule implies_neg2)
% 0.39/0.57  (step t38 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a))))) :rule resolution :premises (t36 t37))
% 0.39/0.57  (step t39 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a))))) :rule contraction :premises (t38))
% 0.39/0.57  (step t40 (cl (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) :rule implies :premises (t39))
% 0.39/0.57  (step t41 (cl (or (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity) (not (tptp.defined tptp.a)))) :rule resolution :premises (t40 a3))
% 0.39/0.57  (step t42 (cl (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) :rule resolution :premises (t33 a26 t41))
% 0.39/0.57  (step t43 (cl (not (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a)))) :rule or_pos)
% 0.39/0.57  (step t44 (cl (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))) (not (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a)))))) :rule reordering :premises (t43))
% 0.39/0.57  (step t45 (cl (not (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a))) :rule or_pos)
% 0.39/0.57  (step t46 (cl (not (tptp.defined tptp.a)) (tptp.defined (tptp.additive_inverse tptp.a)) (not (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a))))) :rule reordering :premises (t45))
% 0.39/0.57  (step t47 (cl (=> (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X))))) :rule implies_neg1)
% 0.39/0.57  (anchor :step t48)
% 0.39/0.57  (assume t48.a0 (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))))
% 0.39/0.57  (step t48.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X))))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.39/0.57  (step t48.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X))))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) :rule or :premises (t48.t1))
% 0.39/0.57  (step t48.t3 (cl (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) :rule resolution :premises (t48.t2 t48.a0))
% 0.39/0.57  (step t48 (cl (not (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X))))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) :rule subproof :discharge (t48.a0))
% 0.39/0.57  (step t49 (cl (=> (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) :rule resolution :premises (t47 t48))
% 0.39/0.57  (step t50 (cl (=> (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) (not (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a))))) :rule implies_neg2)
% 0.39/0.57  (step t51 (cl (=> (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) (=> (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a))))) :rule resolution :premises (t49 t50))
% 0.39/0.57  (step t52 (cl (=> (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X)))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a))))) :rule contraction :premises (t51))
% 0.39/0.57  (step t53 (cl (not (forall ((X $$unsorted)) (or (tptp.defined (tptp.additive_inverse X)) (not (tptp.defined X))))) (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) :rule implies :premises (t52))
% 0.39/0.57  (step t54 (cl (or (tptp.defined (tptp.additive_inverse tptp.a)) (not (tptp.defined tptp.a)))) :rule resolution :premises (t53 a14))
% 0.39/0.57  (step t55 (cl (tptp.defined (tptp.additive_inverse tptp.a))) :rule resolution :premises (t46 a26 t54))
% 0.39/0.57  (step t56 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) :rule implies_neg1)
% 0.39/0.57  (anchor :step t57)
% 0.39/0.57  (assume t57.a0 (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))))
% 0.39/0.57  (step t57.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a)))))) :rule forall_inst :args ((:= X (tptp.additive_inverse tptp.a))))
% 0.39/0.57  (step t57.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) :rule or :premises (t57.t1))
% 0.39/0.57  (step t57.t3 (cl (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) :rule resolution :premises (t57.t2 t57.a0))
% 0.39/0.57  (step t57 (cl (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) :rule subproof :discharge (t57.a0))
% 0.39/0.57  (step t58 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) :rule resolution :premises (t56 t57))
% 0.39/0.57  (step t59 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) (not (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a)))))) :rule implies_neg2)
% 0.39/0.57  (step t60 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a)))))) :rule resolution :premises (t58 t59))
% 0.39/0.57  (step t61 (cl (=> (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X)))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a)))))) :rule contraction :premises (t60))
% 0.39/0.57  (step t62 (cl (not (forall ((X $$unsorted)) (or (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity) (not (tptp.defined X))))) (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) :rule implies :premises (t61))
% 0.39/0.57  (step t63 (cl (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity) (not (tptp.defined (tptp.additive_inverse tptp.a))))) :rule resolution :premises (t62 a3))
% 0.39/0.57  (step t64 (cl (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) :rule resolution :premises (t44 t55 t63))
% 0.39/0.57  (step t65 (cl (not (or (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) tptp.additive_identity tptp.a) (not (tptp.sum (tptp.additive_inverse (tptp.additive_inverse tptp.a)) (tptp.additive_inverse tptp.a) tptp.additive_identity)) (not (tptp.sum (tptp.additive_inverse tptp.a) tptp.a tptp.additive_identity)) (not (tptp.sum tptp.additive_identity tptp.a tptp.a))))) :rule resolution :premises (t9 t20 t31 t42 t64))
% 0.39/0.57  (step t66 (cl) :rule resolution :premises (t7 t65 a0))
% 0.39/0.57  
% 0.39/0.57  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.ZEMrVrRhF4/cvc5---1.0.5_1253.smt2
% 0.39/0.57  % cvc5---1.0.5 exiting
% 0.39/0.57  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------