TSTP Solution File: PLA002-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : PLA002-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n008.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 17:38:23 EDT 2024
% Result : Unsatisfiable 0.37s 0.57s
% Output : Proof 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PLA002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 25 23:09:09 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.37/0.57 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.NroYyLNFjh/cvc5---1.0.5_20355.smt2
% 0.37/0.57 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.NroYyLNFjh/cvc5---1.0.5_20355.smt2
% 0.37/0.58 (assume a0 (forall ((Situation1 $$unsorted) (Situation2 $$unsorted)) (or (tptp.warm Situation1) (tptp.cold Situation2))))
% 0.37/0.58 (assume a1 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.a Situation)) (tptp.at tptp.b (tptp.walk tptp.b Situation)))))
% 0.37/0.58 (assume a2 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.a Situation)) (tptp.at tptp.b (tptp.drive tptp.b Situation)))))
% 0.37/0.58 (assume a3 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))))
% 0.37/0.58 (assume a4 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.drive tptp.a Situation)))))
% 0.37/0.58 (assume a5 (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.b Situation)) (tptp.at tptp.c (tptp.skate tptp.c Situation)))))
% 0.37/0.58 (assume a6 (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))))
% 0.37/0.58 (assume a7 (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.b Situation)) (tptp.at tptp.d (tptp.climb tptp.d Situation)))))
% 0.37/0.58 (assume a8 (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))))
% 0.37/0.58 (assume a9 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))))
% 0.37/0.58 (assume a10 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))))
% 0.37/0.58 (assume a11 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.e (tptp.go tptp.e Situation)))))
% 0.37/0.58 (assume a12 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.e Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))))
% 0.37/0.58 (assume a13 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.f (tptp.go tptp.f Situation)))))
% 0.37/0.58 (assume a14 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))))
% 0.37/0.58 (assume a15 (tptp.at tptp.f tptp.s0))
% 0.37/0.58 (assume a16 (forall ((S $$unsorted)) (not (tptp.at tptp.a S))))
% 0.37/0.58 (step t1 (cl (not (= (forall ((Situation1 $$unsorted) (Situation2 $$unsorted)) (or (tptp.warm Situation1) (tptp.cold Situation2))) (or (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))))) (not (forall ((Situation1 $$unsorted) (Situation2 $$unsorted)) (or (tptp.warm Situation1) (tptp.cold Situation2)))) (or (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)))) :rule equiv_pos2)
% 0.37/0.58 (step t2 (cl (= (forall ((Situation1 $$unsorted) (Situation2 $$unsorted)) (or (tptp.warm Situation1) (tptp.cold Situation2))) (or (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))))) :rule all_simplify)
% 0.37/0.58 (step t3 (cl (or (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)))) :rule resolution :premises (t1 t2 a0))
% 0.37/0.58 (step t4 (cl (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))) :rule or :premises (t3))
% 0.37/0.58 (step t5 (cl (=> (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (forall ((Situation1 $$unsorted)) (tptp.warm Situation1))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t6)
% 0.37/0.58 (assume t6.a0 (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)))
% 0.37/0.58 (step t6.t1 (cl (or (not (forall ((Situation1 $$unsorted)) (tptp.warm Situation1))) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule forall_inst :args ((:= Situation1 (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))
% 0.37/0.58 (step t6.t2 (cl (not (forall ((Situation1 $$unsorted)) (tptp.warm Situation1))) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule or :premises (t6.t1))
% 0.37/0.58 (step t6.t3 (cl (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t6.t2 t6.a0))
% 0.37/0.58 (step t6 (cl (not (forall ((Situation1 $$unsorted)) (tptp.warm Situation1))) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule subproof :discharge (t6.a0))
% 0.37/0.58 (step t7 (cl (=> (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t5 t6))
% 0.37/0.58 (step t8 (cl (=> (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule implies_neg2)
% 0.37/0.58 (step t9 (cl (=> (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (=> (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t7 t8))
% 0.37/0.58 (step t10 (cl (=> (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule contraction :premises (t9))
% 0.37/0.58 (step t11 (cl (not (forall ((Situation1 $$unsorted)) (tptp.warm Situation1))) (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule implies :premises (t10))
% 0.37/0.58 (step t12 (cl (not (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule or_pos)
% 0.37/0.58 (step t13 (cl (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule reordering :premises (t12))
% 0.37/0.58 (step t14 (cl (not (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule or_pos)
% 0.37/0.58 (step t15 (cl (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule reordering :premises (t14))
% 0.37/0.58 (step t16 (cl (not (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) :rule or_pos)
% 0.37/0.58 (step t17 (cl (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))) (not (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule reordering :premises (t16))
% 0.37/0.58 (step t18 (cl (not (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) :rule or_pos)
% 0.37/0.58 (step t19 (cl (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)) (not (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0))))) :rule reordering :premises (t18))
% 0.37/0.58 (step t20 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t21)
% 0.37/0.58 (assume t21.a0 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))))
% 0.37/0.58 (step t21.t1 (cl (or (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0))))) :rule forall_inst :args ((:= Situation tptp.s0)))
% 0.37/0.58 (step t21.t2 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) :rule or :premises (t21.t1))
% 0.37/0.58 (step t21.t3 (cl (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) :rule resolution :premises (t21.t2 t21.a0))
% 0.37/0.58 (step t21 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) :rule subproof :discharge (t21.a0))
% 0.37/0.58 (step t22 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) :rule resolution :premises (t20 t21))
% 0.37/0.58 (step t23 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) (not (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0))))) :rule implies_neg2)
% 0.37/0.58 (step t24 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t22 t23))
% 0.37/0.58 (step t25 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0))))) :rule contraction :premises (t24))
% 0.37/0.58 (step t26 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.f Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) :rule implies :premises (t25))
% 0.37/0.58 (step t27 (cl (or (not (tptp.at tptp.f tptp.s0)) (tptp.at tptp.d (tptp.go tptp.d tptp.s0)))) :rule resolution :premises (t26 a14))
% 0.37/0.58 (step t28 (cl (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) :rule resolution :premises (t19 a15 t27))
% 0.37/0.58 (step t29 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation))))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t30)
% 0.37/0.58 (assume t30.a0 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))))
% 0.37/0.58 (step t30.t1 (cl (or (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation))))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule forall_inst :args ((:= Situation (tptp.go tptp.d tptp.s0))))
% 0.37/0.58 (step t30.t2 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation))))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule or :premises (t30.t1))
% 0.37/0.58 (step t30.t3 (cl (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t30.t2 t30.a0))
% 0.37/0.58 (step t30 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation))))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule subproof :discharge (t30.a0))
% 0.37/0.58 (step t31 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t29 t30))
% 0.37/0.58 (step t32 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule implies_neg2)
% 0.37/0.58 (step t33 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t31 t32))
% 0.37/0.58 (step t34 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation)))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule contraction :premises (t33))
% 0.37/0.58 (step t35 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.d Situation)) (tptp.at tptp.c (tptp.go tptp.c Situation))))) (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule implies :premises (t34))
% 0.37/0.58 (step t36 (cl (or (not (tptp.at tptp.d (tptp.go tptp.d tptp.s0))) (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t35 a10))
% 0.37/0.58 (step t37 (cl (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) :rule resolution :premises (t17 t28 t36))
% 0.37/0.58 (step t38 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t39)
% 0.37/0.58 (assume t39.a0 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))))
% 0.37/0.58 (step t39.t1 (cl (or (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule forall_inst :args ((:= Situation (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))
% 0.37/0.58 (step t39.t2 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule or :premises (t39.t1))
% 0.37/0.58 (step t39.t3 (cl (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t39.t2 t39.a0))
% 0.37/0.58 (step t39 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule subproof :discharge (t39.a0))
% 0.37/0.58 (step t40 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t38 t39))
% 0.37/0.58 (step t41 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (not (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule implies_neg2)
% 0.37/0.58 (step t42 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t40 t41))
% 0.37/0.58 (step t43 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation)))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule contraction :premises (t42))
% 0.37/0.58 (step t44 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.c Situation)) (tptp.at tptp.d (tptp.go tptp.d Situation))))) (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule implies :premises (t43))
% 0.37/0.58 (step t45 (cl (or (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t44 a9))
% 0.37/0.58 (step t46 (cl (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t15 t37 t45))
% 0.37/0.58 (step t47 (cl (not (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule or_pos)
% 0.37/0.58 (step t48 (cl (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (not (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule reordering :premises (t47))
% 0.37/0.58 (step t49 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t50)
% 0.37/0.58 (assume t50.a0 (forall ((S $$unsorted)) (not (tptp.at tptp.a S))))
% 0.37/0.58 (step t50.t1 (cl (or (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule forall_inst :args ((:= S (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))
% 0.37/0.58 (step t50.t2 (cl (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule or :premises (t50.t1))
% 0.37/0.58 (step t50.t3 (cl (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t50.t2 t50.a0))
% 0.37/0.58 (step t50 (cl (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule subproof :discharge (t50.a0))
% 0.37/0.58 (step t51 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t49 t50))
% 0.37/0.58 (step t52 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (not (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule implies_neg2)
% 0.37/0.58 (step t53 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule resolution :premises (t51 t52))
% 0.37/0.58 (step t54 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule contraction :premises (t53))
% 0.37/0.58 (step t55 (cl (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule implies :premises (t54))
% 0.37/0.58 (step t56 (cl (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t55 a16))
% 0.37/0.58 (step t57 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t58)
% 0.37/0.58 (assume t58.a0 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))))
% 0.37/0.58 (step t58.t1 (cl (or (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule forall_inst :args ((:= Situation (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))
% 0.37/0.58 (step t58.t2 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule or :premises (t58.t1))
% 0.37/0.58 (step t58.t3 (cl (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t58.t2 t58.a0))
% 0.37/0.58 (step t58 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule subproof :discharge (t58.a0))
% 0.37/0.58 (step t59 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t57 t58))
% 0.37/0.58 (step t60 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (not (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule implies_neg2)
% 0.37/0.58 (step t61 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule resolution :premises (t59 t60))
% 0.37/0.58 (step t62 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))))) :rule contraction :premises (t61))
% 0.37/0.58 (step t63 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule implies :premises (t62))
% 0.37/0.58 (step t64 (cl (or (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t63 a3))
% 0.37/0.58 (step t65 (cl (not (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t48 t56 t64))
% 0.37/0.58 (step t66 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation))))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t67)
% 0.37/0.58 (assume t67.a0 (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))))
% 0.37/0.58 (step t67.t1 (cl (or (not (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation))))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule forall_inst :args ((:= Situation (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))
% 0.37/0.58 (step t67.t2 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation))))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule or :premises (t67.t1))
% 0.37/0.58 (step t67.t3 (cl (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t67.t2 t67.a0))
% 0.37/0.58 (step t67 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation))))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule subproof :discharge (t67.a0))
% 0.37/0.58 (step t68 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t66 t67))
% 0.37/0.58 (step t69 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (not (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule implies_neg2)
% 0.37/0.58 (step t70 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (=> (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t68 t69))
% 0.37/0.58 (step t71 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation)))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule contraction :premises (t70))
% 0.37/0.58 (step t72 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.warm Situation)) (not (tptp.at tptp.d Situation)) (tptp.at tptp.b (tptp.climb tptp.b Situation))))) (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule implies :premises (t71))
% 0.37/0.58 (step t73 (cl (or (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (tptp.at tptp.d (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.b (tptp.climb tptp.b (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t72 a8))
% 0.37/0.58 (step t74 (cl (not (tptp.warm (tptp.go tptp.d (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t13 t46 t65 t73))
% 0.37/0.58 (step t75 (cl (not (forall ((Situation1 $$unsorted)) (tptp.warm Situation1)))) :rule resolution :premises (t11 t74))
% 0.37/0.58 (step t76 (cl (=> (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t77)
% 0.37/0.58 (assume t77.a0 (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)))
% 0.37/0.58 (step t77.t1 (cl (or (not (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule forall_inst :args ((:= Situation2 (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))
% 0.37/0.58 (step t77.t2 (cl (not (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) :rule or :premises (t77.t1))
% 0.37/0.58 (step t77.t3 (cl (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) :rule resolution :premises (t77.t2 t77.a0))
% 0.37/0.58 (step t77 (cl (not (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) :rule subproof :discharge (t77.a0))
% 0.37/0.58 (step t78 (cl (=> (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) :rule resolution :premises (t76 t77))
% 0.37/0.58 (step t79 (cl (=> (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule implies_neg2)
% 0.37/0.58 (step t80 (cl (=> (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (=> (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t78 t79))
% 0.37/0.58 (step t81 (cl (=> (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule contraction :premises (t80))
% 0.37/0.58 (step t82 (cl (not (forall ((Situation2 $$unsorted)) (tptp.cold Situation2))) (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) :rule implies :premises (t81))
% 0.37/0.58 (step t83 (cl (not (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule or_pos)
% 0.37/0.58 (step t84 (cl (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule reordering :premises (t83))
% 0.37/0.58 (step t85 (cl (not (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule or_pos)
% 0.37/0.58 (step t86 (cl (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (not (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule reordering :premises (t85))
% 0.37/0.58 (step t87 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t88)
% 0.37/0.58 (assume t88.a0 (forall ((S $$unsorted)) (not (tptp.at tptp.a S))))
% 0.37/0.58 (step t88.t1 (cl (or (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule forall_inst :args ((:= S (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))
% 0.37/0.58 (step t88.t2 (cl (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule or :premises (t88.t1))
% 0.37/0.58 (step t88.t3 (cl (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t88.t2 t88.a0))
% 0.37/0.58 (step t88 (cl (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule subproof :discharge (t88.a0))
% 0.37/0.58 (step t89 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t87 t88))
% 0.37/0.58 (step t90 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (not (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule implies_neg2)
% 0.37/0.58 (step t91 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t89 t90))
% 0.37/0.58 (step t92 (cl (=> (forall ((S $$unsorted)) (not (tptp.at tptp.a S))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule contraction :premises (t91))
% 0.37/0.58 (step t93 (cl (not (forall ((S $$unsorted)) (not (tptp.at tptp.a S)))) (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule implies :premises (t92))
% 0.37/0.58 (step t94 (cl (not (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t93 a16))
% 0.37/0.58 (step t95 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t96)
% 0.37/0.58 (assume t96.a0 (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))))
% 0.37/0.58 (step t96.t1 (cl (or (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule forall_inst :args ((:= Situation (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))
% 0.37/0.58 (step t96.t2 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule or :premises (t96.t1))
% 0.37/0.58 (step t96.t3 (cl (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t96.t2 t96.a0))
% 0.37/0.58 (step t96 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule subproof :discharge (t96.a0))
% 0.37/0.58 (step t97 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t95 t96))
% 0.37/0.58 (step t98 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (not (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule implies_neg2)
% 0.37/0.58 (step t99 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule resolution :premises (t97 t98))
% 0.37/0.58 (step t100 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation)))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))))) :rule contraction :premises (t99))
% 0.37/0.58 (step t101 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.at tptp.b Situation)) (tptp.at tptp.a (tptp.walk tptp.a Situation))))) (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule implies :premises (t100))
% 0.37/0.58 (step t102 (cl (or (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) (tptp.at tptp.a (tptp.walk tptp.a (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t101 a3))
% 0.37/0.58 (step t103 (cl (not (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t86 t94 t102))
% 0.37/0.58 (step t104 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation))))) :rule implies_neg1)
% 0.37/0.58 (anchor :step t105)
% 0.37/0.58 (assume t105.a0 (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))))
% 0.37/0.58 (step t105.t1 (cl (or (not (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation))))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule forall_inst :args ((:= Situation (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))
% 0.37/0.58 (step t105.t2 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation))))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule or :premises (t105.t1))
% 0.37/0.58 (step t105.t3 (cl (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t105.t2 t105.a0))
% 0.37/0.58 (step t105 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation))))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule subproof :discharge (t105.a0))
% 0.37/0.58 (step t106 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t104 t105))
% 0.37/0.58 (step t107 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (not (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule implies_neg2)
% 0.37/0.58 (step t108 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) (=> (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule resolution :premises (t106 t107))
% 0.37/0.58 (step t109 (cl (=> (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation)))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))))) :rule contraction :premises (t108))
% 0.37/0.58 (step t110 (cl (not (forall ((Situation $$unsorted)) (or (not (tptp.cold Situation)) (not (tptp.at tptp.c Situation)) (tptp.at tptp.b (tptp.skate tptp.b Situation))))) (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule implies :premises (t109))
% 0.37/0.58 (step t111 (cl (or (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (not (tptp.at tptp.c (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))) (tptp.at tptp.b (tptp.skate tptp.b (tptp.go tptp.c (tptp.go tptp.d tptp.s0)))))) :rule resolution :premises (t110 a6))
% 0.37/0.58 (step t112 (cl (not (tptp.cold (tptp.go tptp.c (tptp.go tptp.d tptp.s0))))) :rule resolution :premises (t84 t37 t103 t111))
% 0.37/0.58 (step t113 (cl (not (forall ((Situation2 $$unsorted)) (tptp.cold Situation2)))) :rule resolution :premises (t82 t112))
% 0.37/0.58 (step t114 (cl) :rule resolution :premises (t4 t75 t113))
% 0.37/0.58
% 0.37/0.58 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.NroYyLNFjh/cvc5---1.0.5_20355.smt2
% 0.37/0.59 % cvc5---1.0.5 exiting
% 0.37/0.59 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------