TSTP Solution File: SYN060-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN060-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n013.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:24:22 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN060-1 : TPTP v8.2.0. Released v1.0.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 28 13:30:24 EDT 2024
% 0.14/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.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.8SiayI1yKP/cvc5---1.0.5_13162.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.8SiayI1yKP/cvc5---1.0.5_13162.smt2
% 0.20/0.52 (assume a0 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))))
% 0.20/0.52 (assume a1 (forall ((X $$unsorted)) (or (tptp.big_g X) (tptp.big_f X))))
% 0.20/0.52 (assume a2 (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (not (tptp.big_h X)))))
% 0.20/0.52 (assume a3 (forall ((X $$unsorted)) (or (tptp.big_g X) (tptp.big_h X))))
% 0.20/0.52 (assume a4 (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))))
% 0.20/0.52 (assume a5 (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))))
% 0.20/0.52 (assume a6 (not (tptp.big_i tptp.a)))
% 0.20/0.52 (step t1 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t2)
% 0.20/0.52 (assume t2.a0 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))))
% 0.20/0.52 (step t2.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.20/0.52 (step t2.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) :rule or :premises (t2.t1))
% 0.20/0.52 (step t2.t3 (cl (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.20/0.52 (step t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) :rule subproof :discharge (t2.a0))
% 0.20/0.52 (step t3 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) :rule resolution :premises (t1 t2))
% 0.20/0.52 (step t4 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) (not (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a))))) :rule implies_neg2)
% 0.20/0.52 (step t5 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a))))) :rule resolution :premises (t3 t4))
% 0.20/0.52 (step t6 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X)))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a))))) :rule contraction :premises (t5))
% 0.20/0.52 (step t7 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) :rule implies :premises (t6))
% 0.20/0.52 (step t8 (cl (not (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)))) (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a))) :rule or_pos)
% 0.20/0.52 (step t9 (cl (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a)) (not (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a))))) :rule reordering :premises (t8))
% 0.20/0.52 (step t10 (cl (not (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) (tptp.big_i tptp.a) (tptp.big_f tptp.a)) :rule or_pos)
% 0.20/0.52 (step t11 (cl (tptp.big_i tptp.a) (tptp.big_f tptp.a) (not (or (tptp.big_i tptp.a) (tptp.big_f tptp.a)))) :rule reordering :premises (t10))
% 0.20/0.52 (step t12 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X)))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t13)
% 0.20/0.52 (assume t13.a0 (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))))
% 0.20/0.52 (step t13.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X)))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a)))) :rule forall_inst :args ((:= X tptp.a)))
% 0.20/0.52 (step t13.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X)))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) :rule or :premises (t13.t1))
% 0.20/0.52 (step t13.t3 (cl (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) :rule resolution :premises (t13.t2 t13.a0))
% 0.20/0.52 (step t13 (cl (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X)))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) :rule subproof :discharge (t13.a0))
% 0.20/0.52 (step t14 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) :rule resolution :premises (t12 t13))
% 0.20/0.52 (step t15 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) (not (or (tptp.big_i tptp.a) (tptp.big_f tptp.a)))) :rule implies_neg2)
% 0.20/0.52 (step t16 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a)))) :rule resolution :premises (t14 t15))
% 0.20/0.52 (step t17 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a)))) :rule contraction :premises (t16))
% 0.20/0.52 (step t18 (cl (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_f X)))) (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) :rule implies :premises (t17))
% 0.20/0.52 (step t19 (cl (or (tptp.big_i tptp.a) (tptp.big_f tptp.a))) :rule resolution :premises (t18 a4))
% 0.20/0.52 (step t20 (cl (tptp.big_f tptp.a)) :rule resolution :premises (t11 a6 t19))
% 0.20/0.52 (step t21 (cl (not (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) (tptp.big_i tptp.a) (tptp.big_h tptp.a)) :rule or_pos)
% 0.20/0.52 (step t22 (cl (tptp.big_i tptp.a) (tptp.big_h tptp.a) (not (or (tptp.big_i tptp.a) (tptp.big_h tptp.a)))) :rule reordering :premises (t21))
% 0.20/0.52 (step t23 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X)))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t24)
% 0.20/0.52 (assume t24.a0 (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))))
% 0.20/0.52 (step t24.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X)))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a)))) :rule forall_inst :args ((:= X tptp.a)))
% 0.20/0.52 (step t24.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X)))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) :rule or :premises (t24.t1))
% 0.20/0.52 (step t24.t3 (cl (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) :rule resolution :premises (t24.t2 t24.a0))
% 0.20/0.52 (step t24 (cl (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X)))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) :rule subproof :discharge (t24.a0))
% 0.20/0.52 (step t25 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) :rule resolution :premises (t23 t24))
% 0.20/0.52 (step t26 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) (not (or (tptp.big_i tptp.a) (tptp.big_h tptp.a)))) :rule implies_neg2)
% 0.20/0.52 (step t27 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a)))) :rule resolution :premises (t25 t26))
% 0.20/0.52 (step t28 (cl (=> (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a)))) :rule contraction :premises (t27))
% 0.20/0.52 (step t29 (cl (not (forall ((X $$unsorted)) (or (tptp.big_i X) (tptp.big_h X)))) (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) :rule implies :premises (t28))
% 0.20/0.52 (step t30 (cl (or (tptp.big_i tptp.a) (tptp.big_h tptp.a))) :rule resolution :premises (t29 a5))
% 0.20/0.52 (step t31 (cl (tptp.big_h tptp.a)) :rule resolution :premises (t22 a6 t30))
% 0.20/0.52 (step t32 (cl (not (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a))))) :rule resolution :premises (t9 t20 t31))
% 0.20/0.52 (step t33 (cl) :rule resolution :premises (t7 t32 a0))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.8SiayI1yKP/cvc5---1.0.5_13162.smt2
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------