TSTP Solution File: SYN930+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN930+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n022.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:26:53 EDT 2024
% Result : Theorem 0.22s 0.54s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN930+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue May 28 13:55:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.54 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.nnBn1WYWEj/cvc5---1.0.5_4081.smt2
% 0.22/0.54 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.nnBn1WYWEj/cvc5---1.0.5_4081.smt2
% 0.22/0.54 (assume a0 (not (= (forall ((X $$unsorted)) (or (tptp.p X) tptp.c)) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c))))
% 0.22/0.54 (assume a1 true)
% 0.22/0.54 (step t1 (cl (or tptp.c (forall ((X $$unsorted)) (tptp.p X))) (not (forall ((X $$unsorted)) (tptp.p X)))) :rule or_neg)
% 0.22/0.54 (step t2 (cl (not (= (not (= (forall ((X $$unsorted)) (or (tptp.p X) tptp.c)) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c))) (not (= (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or tptp.c (forall ((X $$unsorted)) (tptp.p X))))))) (not (not (= (forall ((X $$unsorted)) (or (tptp.p X) tptp.c)) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)))) (not (= (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))))) :rule equiv_pos2)
% 0.22/0.54 (step t3 (cl (= (forall ((X $$unsorted)) (or (tptp.p X) tptp.c)) (or tptp.c (forall ((X $$unsorted)) (tptp.p X))))) :rule all_simplify)
% 0.22/0.54 (step t4 (cl (= (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c))) :rule refl)
% 0.22/0.54 (step t5 (cl (= (= (forall ((X $$unsorted)) (or (tptp.p X) tptp.c)) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)) (= (or tptp.c (forall ((X $$unsorted)) (tptp.p X))) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)))) :rule cong :premises (t3 t4))
% 0.22/0.54 (step t6 (cl (= (= (or tptp.c (forall ((X $$unsorted)) (tptp.p X))) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)) (= (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))))) :rule all_simplify)
% 0.22/0.54 (step t7 (cl (= (= (forall ((X $$unsorted)) (or (tptp.p X) tptp.c)) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)) (= (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))))) :rule trans :premises (t5 t6))
% 0.22/0.54 (step t8 (cl (= (not (= (forall ((X $$unsorted)) (or (tptp.p X) tptp.c)) (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c))) (not (= (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or tptp.c (forall ((X $$unsorted)) (tptp.p X))))))) :rule cong :premises (t7))
% 0.22/0.54 (step t9 (cl (not (= (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))))) :rule resolution :premises (t2 t8 a0))
% 0.22/0.54 (step t10 (cl (not (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)) (not (or tptp.c (forall ((X $$unsorted)) (tptp.p X))))) :rule not_equiv2 :premises (t9))
% 0.22/0.54 (step t11 (cl (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (not (forall ((X $$unsorted)) (tptp.p X)))) :rule or_neg)
% 0.22/0.54 (step t12 (cl (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (not tptp.c)) :rule or_neg)
% 0.22/0.54 (step t13 (cl (not (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))) tptp.c (forall ((X $$unsorted)) (tptp.p X))) :rule or_pos)
% 0.22/0.54 (step t14 (cl tptp.c (forall ((X $$unsorted)) (tptp.p X)) (not (or tptp.c (forall ((X $$unsorted)) (tptp.p X))))) :rule reordering :premises (t13))
% 0.22/0.54 (step t15 (cl (= (forall ((X $$unsorted)) (tptp.p X)) (forall ((X $$unsorted)) (tptp.p X)))) :rule hole :args ((forall ((X $$unsorted)) (tptp.p X)) (= X X)))
% 0.22/0.54 (step t16 (cl (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((X $$unsorted)) (tptp.p X)))) :rule equiv2 :premises (t15))
% 0.22/0.54 (step t17 (cl (not (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))) (not (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))) (forall ((X $$unsorted)) (tptp.p X))) :rule resolution :premises (t12 t14 t10 t16))
% 0.22/0.54 (step t18 (cl (not (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))) (forall ((X $$unsorted)) (tptp.p X))) :rule contraction :premises (t17))
% 0.22/0.54 (step t19 (cl (not (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)) (forall ((X $$unsorted)) (tptp.p X)) tptp.c) :rule or_pos)
% 0.22/0.54 (step t20 (cl tptp.c (forall ((X $$unsorted)) (tptp.p X)) (not (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c))) :rule reordering :premises (t19))
% 0.22/0.54 (step t21 (cl (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c) (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))) :rule not_equiv1 :premises (t9))
% 0.22/0.54 (step t22 (cl (or tptp.c (forall ((X $$unsorted)) (tptp.p X))) (not tptp.c)) :rule or_neg)
% 0.22/0.54 (step t23 (cl (forall ((X $$unsorted)) (tptp.p X)) (or tptp.c (forall ((X $$unsorted)) (tptp.p X))) (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))) :rule resolution :premises (t20 t21 t22))
% 0.22/0.54 (step t24 (cl (forall ((X $$unsorted)) (tptp.p X)) (or tptp.c (forall ((X $$unsorted)) (tptp.p X)))) :rule contraction :premises (t23))
% 0.22/0.54 (step t25 (cl (forall ((X $$unsorted)) (tptp.p X)) (forall ((X $$unsorted)) (tptp.p X))) :rule resolution :premises (t18 t24))
% 0.22/0.54 (step t26 (cl (forall ((X $$unsorted)) (tptp.p X))) :rule contraction :premises (t25))
% 0.22/0.54 (step t27 (cl (or (forall ((X $$unsorted)) (tptp.p X)) tptp.c)) :rule resolution :premises (t11 t26))
% 0.22/0.54 (step t28 (cl (not (or tptp.c (forall ((X $$unsorted)) (tptp.p X))))) :rule resolution :premises (t10 t27))
% 0.22/0.54 (step t29 (cl (not (forall ((X $$unsorted)) (tptp.p X))) (forall ((X $$unsorted)) (tptp.p X))) :rule equiv1 :premises (t15))
% 0.22/0.54 (step t30 (cl (forall ((X $$unsorted)) (tptp.p X)) (not (forall ((X $$unsorted)) (tptp.p X)))) :rule reordering :premises (t29))
% 0.22/0.54 (step t31 (cl (forall ((X $$unsorted)) (tptp.p X))) :rule resolution :premises (t30 t26))
% 0.22/0.54 (step t32 (cl) :rule resolution :premises (t1 t28 t31))
% 0.22/0.54
% 0.22/0.54 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.nnBn1WYWEj/cvc5---1.0.5_4081.smt2
% 0.22/0.54 % cvc5---1.0.5 exiting
% 0.22/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------