TSTP Solution File: SWW423-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWW423-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n028.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 18:19:17 EDT 2024
% Result : Unsatisfiable 0.40s 0.58s
% Output : Proof 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.16 % Problem : SWW423-1 : TPTP v8.2.0. Released v5.2.0.
% 0.18/0.18 % Command : do_cvc5 %s %d
% 0.18/0.40 % Computer : n028.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 300
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Sun May 26 05:37:39 EDT 2024
% 0.18/0.40 % CPUTime :
% 0.25/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.25/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.40/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.yYyCCaupgv/cvc5---1.0.5_27932.smt2
% 0.40/0.58 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.yYyCCaupgv/cvc5---1.0.5_27932.smt2
% 0.40/0.59 (assume a0 (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))))
% 0.40/0.59 (assume a1 (forall ((X $$unsorted) (Sigma $$unsorted)) (= (tptp.sep (tptp.lseg X X) Sigma) Sigma)))
% 0.40/0.59 (assume a2 (forall ((Y $$unsorted) (Sigma $$unsorted)) (not (tptp.heap (tptp.sep (tptp.next tptp.nil Y) Sigma)))))
% 0.40/0.59 (assume a3 (forall ((Y $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.lseg tptp.nil Y) Sigma))) (= Y tptp.nil))))
% 0.40/0.59 (assume a4 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.next X Z) Sigma))))))
% 0.40/0.59 (assume a5 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg X Z) Sigma)))) (= X Z))))
% 0.40/0.59 (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.lseg X Y) (tptp.sep (tptp.lseg X Z) Sigma)))) (= X Y) (= X Z))))
% 0.40/0.59 (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))))
% 0.40/0.59 (assume a8 (forall ((X $$unsorted) (Y $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.lseg X Y) (tptp.sep (tptp.lseg Y tptp.nil) Sigma)))) (tptp.heap (tptp.sep (tptp.lseg X tptp.nil) Sigma)))))
% 0.40/0.59 (assume a9 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.lseg X Y) (tptp.sep (tptp.lseg Y Z) (tptp.sep (tptp.next Z W) Sigma))))) (tptp.heap (tptp.sep (tptp.lseg X Z) (tptp.sep (tptp.next Z W) Sigma))))))
% 0.40/0.59 (assume a10 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.lseg X Y) (tptp.sep (tptp.lseg Y Z) (tptp.sep (tptp.lseg Z W) Sigma))))) (= Z W) (tptp.heap (tptp.sep (tptp.lseg X Z) (tptp.sep (tptp.lseg Z W) Sigma))))))
% 0.40/0.59 (assume a11 (not (= tptp.nil tptp.x1)))
% 0.40/0.59 (assume a12 (not (= tptp.x2 tptp.x1)))
% 0.40/0.59 (assume a13 (not (= tptp.x1 tptp.x3)))
% 0.40/0.59 (assume a14 (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))))
% 0.40/0.59 (assume a15 (not (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))
% 0.40/0.59 (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma))))) :rule implies_neg1)
% 0.40/0.59 (anchor :step t2)
% 0.40/0.59 (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))))
% 0.40/0.59 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma))))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule forall_inst :args ((:= X tptp.x1) (:= Y tptp.x2) (:= Z tptp.nil) (:= Sigma (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))
% 0.40/0.59 (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma))))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule or :premises (t2.t1))
% 0.40/0.59 (step t2.t3 (cl (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.40/0.59 (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma))))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule subproof :discharge (t2.a0))
% 0.40/0.59 (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t1 t2))
% 0.40/0.59 (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule implies_neg2)
% 0.40/0.59 (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule resolution :premises (t3 t4))
% 0.40/0.59 (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma)))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule contraction :premises (t5))
% 0.40/0.59 (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (Sigma $$unsorted)) (or (not (tptp.heap (tptp.sep (tptp.next X Y) (tptp.sep (tptp.lseg Y Z) Sigma)))) (= X Y) (tptp.heap (tptp.sep (tptp.lseg X Z) Sigma))))) (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule implies :premises (t6))
% 0.40/0.59 (step t8 (cl (not (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule or_pos)
% 0.40/0.59 (step t9 (cl (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= tptp.x1 tptp.x2) (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule reordering :premises (t8))
% 0.40/0.59 (step t10 (cl (not (= tptp.x1 tptp.x2))) :rule not_symm :premises (a12))
% 0.40/0.59 (step t11 (cl (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) (not (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule and_neg)
% 0.40/0.59 (step t12 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule implies_neg1)
% 0.40/0.59 (anchor :step t13)
% 0.40/0.59 (assume t13.a0 (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))))
% 0.40/0.59 (assume t13.a1 (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))
% 0.40/0.59 (assume t13.a2 (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))
% 0.40/0.59 (step t13.t1 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule implies_neg1)
% 0.40/0.59 (anchor :step t13.t2)
% 0.40/0.59 (assume t13.t2.a0 (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))))
% 0.40/0.59 (assume t13.t2.a1 (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))
% 0.40/0.59 (assume t13.t2.a2 (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))
% 0.40/0.59 (step t13.t2.t1 (cl (= (= (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) true) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule equiv_simplify)
% 0.40/0.59 (step t13.t2.t2 (cl (not (= (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) true)) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule equiv1 :premises (t13.t2.t1))
% 0.40/0.59 (step t13.t2.t3 (cl (= (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule symm :premises (t13.t2.a2))
% 0.40/0.59 (step t13.t2.t4 (cl (= (tptp.lseg tptp.x2 tptp.nil) (tptp.lseg tptp.x2 tptp.nil))) :rule refl)
% 0.40/0.59 (step t13.t2.t5 (cl (= (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) :rule symm :premises (t13.t2.a1))
% 0.40/0.59 (step t13.t2.t6 (cl (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) :rule cong :premises (t13.t2.t4 t13.t2.t5))
% 0.40/0.59 (step t13.t2.t7 (cl (= (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) :rule trans :premises (t13.t2.t3 t13.t2.t6))
% 0.40/0.59 (step t13.t2.t8 (cl (= (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))))) :rule cong :premises (t13.t2.t7))
% 0.40/0.59 (step t13.t2.t9 (cl (= (= (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) true) (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))))) :rule equiv_simplify)
% 0.40/0.59 (step t13.t2.t10 (cl (= (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) true) (not (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))))) :rule equiv2 :premises (t13.t2.t9))
% 0.40/0.59 (step t13.t2.t11 (cl (= (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) true)) :rule resolution :premises (t13.t2.t10 t13.t2.a0))
% 0.40/0.59 (step t13.t2.t12 (cl (= (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) true)) :rule trans :premises (t13.t2.t8 t13.t2.t11))
% 0.40/0.59 (step t13.t2.t13 (cl (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t13.t2.t2 t13.t2.t12))
% 0.40/0.59 (step t13.t2 (cl (not (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) (not (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule subproof :discharge (t13.t2.a0 t13.t2.a1 t13.t2.a2))
% 0.40/0.59 (step t13.t3 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) :rule and_pos)
% 0.40/0.59 (step t13.t4 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule and_pos)
% 0.40/0.59 (step t13.t5 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule and_pos)
% 0.40/0.59 (step t13.t6 (cl (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))))) :rule resolution :premises (t13.t2 t13.t3 t13.t4 t13.t5))
% 0.40/0.59 (step t13.t7 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule reordering :premises (t13.t6))
% 0.40/0.59 (step t13.t8 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule contraction :premises (t13.t7))
% 0.40/0.59 (step t13.t9 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t13.t1 t13.t8))
% 0.40/0.59 (step t13.t10 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule implies_neg2)
% 0.40/0.59 (step t13.t11 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule resolution :premises (t13.t9 t13.t10))
% 0.40/0.59 (step t13.t12 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule contraction :premises (t13.t11))
% 0.40/0.59 (step t13.t13 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule implies :premises (t13.t12))
% 0.40/0.59 (step t13.t14 (cl (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) (not (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule and_neg)
% 0.40/0.59 (step t13.t15 (cl (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule resolution :premises (t13.t14 t13.a0 t13.a1 t13.a2))
% 0.40/0.59 (step t13.t16 (cl (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t13.t13 t13.t15))
% 0.40/0.59 (step t13 (cl (not (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) (not (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule subproof :discharge (t13.a0 t13.a1 t13.a2))
% 0.40/0.59 (step t14 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) :rule and_pos)
% 0.40/0.59 (step t15 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule and_pos)
% 0.40/0.59 (step t16 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule and_pos)
% 0.40/0.59 (step t17 (cl (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))))) :rule resolution :premises (t13 t14 t15 t16))
% 0.40/0.59 (step t18 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule reordering :premises (t17))
% 0.40/0.59 (step t19 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule contraction :premises (t18))
% 0.40/0.59 (step t20 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t12 t19))
% 0.40/0.59 (step t21 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule implies_neg2)
% 0.40/0.59 (step t22 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule resolution :premises (t20 t21))
% 0.40/0.59 (step t23 (cl (=> (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule contraction :premises (t22))
% 0.40/0.59 (step t24 (cl (not (and (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule implies :premises (t23))
% 0.40/0.59 (step t25 (cl (not (tptp.heap (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp))))) (not (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t11 t24))
% 0.40/0.59 (step t26 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) :rule implies_neg1)
% 0.40/0.59 (anchor :step t27)
% 0.40/0.59 (assume t27.a0 (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))))
% 0.40/0.59 (step t27.t1 (cl (or (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule forall_inst :args ((:= S (tptp.lseg tptp.x3 tptp.nil)) (:= T (tptp.next tptp.x1 tptp.x2)) (:= Sigma tptp.emp)))
% 0.40/0.59 (step t27.t2 (cl (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule or :premises (t27.t1))
% 0.40/0.59 (step t27.t3 (cl (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule resolution :premises (t27.t2 t27.a0))
% 0.40/0.59 (step t27 (cl (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule subproof :discharge (t27.a0))
% 0.40/0.59 (step t28 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule resolution :premises (t26 t27))
% 0.40/0.59 (step t29 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (not (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule implies_neg2)
% 0.40/0.59 (step t30 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t28 t29))
% 0.40/0.59 (step t31 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule contraction :premises (t30))
% 0.40/0.59 (step t32 (cl (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule implies :premises (t31))
% 0.40/0.59 (step t33 (cl (= (tptp.sep (tptp.lseg tptp.x3 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) tptp.emp)) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))) :rule resolution :premises (t32 a0))
% 0.40/0.59 (step t34 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) :rule implies_neg1)
% 0.40/0.59 (anchor :step t35)
% 0.40/0.59 (assume t35.a0 (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))))
% 0.40/0.59 (step t35.t1 (cl (or (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule forall_inst :args ((:= S (tptp.lseg tptp.x2 tptp.nil)) (:= T (tptp.next tptp.x1 tptp.x2)) (:= Sigma (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))
% 0.40/0.59 (step t35.t2 (cl (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule or :premises (t35.t1))
% 0.40/0.59 (step t35.t3 (cl (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t35.t2 t35.a0))
% 0.40/0.59 (step t35 (cl (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule subproof :discharge (t35.a0))
% 0.40/0.59 (step t36 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t34 t35))
% 0.40/0.59 (step t37 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (not (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule implies_neg2)
% 0.40/0.59 (step t38 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule resolution :premises (t36 t37))
% 0.40/0.59 (step t39 (cl (=> (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma)))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule contraction :premises (t38))
% 0.40/0.59 (step t40 (cl (not (forall ((S $$unsorted) (T $$unsorted) (Sigma $$unsorted)) (= (tptp.sep S (tptp.sep T Sigma)) (tptp.sep T (tptp.sep S Sigma))))) (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule implies :premises (t39))
% 0.40/0.59 (step t41 (cl (= (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))) (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t40 a0))
% 0.40/0.59 (step t42 (cl (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) :rule resolution :premises (t25 a14 t33 t41))
% 0.40/0.59 (step t43 (cl (not (or (not (tptp.heap (tptp.sep (tptp.next tptp.x1 tptp.x2) (tptp.sep (tptp.lseg tptp.x2 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp))))) (= tptp.x1 tptp.x2) (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) (tptp.sep (tptp.lseg tptp.x3 tptp.nil) tptp.emp)))))) :rule resolution :premises (t9 a15 t10 t42))
% 0.40/0.59 (step t44 (cl) :rule resolution :premises (t7 t43 a7))
% 0.40/0.59
% 0.41/0.59 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.yYyCCaupgv/cvc5---1.0.5_27932.smt2
% 0.41/0.59 % cvc5---1.0.5 exiting
% 0.41/0.60 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------