TSTP Solution File: SYN068-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN068-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n032.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:25 EDT 2024
% Result : Unsatisfiable 0.16s 0.46s
% Output : Proof 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SYN068-1 : TPTP v8.2.0. Released v1.0.0.
% 0.05/0.13 % Command : do_cvc5 %s %d
% 0.11/0.33 % Computer : n032.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue May 28 13:32:54 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.16/0.44 %----Proving TF0_NAR, FOF, or CNF
% 0.16/0.45 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.16/0.46 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.bVNjleknTx/cvc5---1.0.5_11338.smt2
% 0.16/0.46 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.bVNjleknTx/cvc5---1.0.5_11338.smt2
% 0.16/0.46 (assume a0 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.f X)))))
% 0.16/0.46 (assume a1 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_h X (tptp.f X)))))
% 0.16/0.46 (assume a2 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))))
% 0.16/0.46 (assume a3 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))))
% 0.16/0.46 (assume a4 (tptp.big_j tptp.a))
% 0.16/0.46 (assume a5 (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))))
% 0.16/0.46 (assume a6 (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))))
% 0.16/0.46 (step t1 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X)))) :rule implies_neg1)
% 0.16/0.46 (anchor :step t2)
% 0.16/0.46 (assume t2.a0 (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))))
% 0.16/0.46 (step t2.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X)))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule forall_inst :args ((:= X (tptp.g tptp.a))))
% 0.16/0.46 (step t2.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X)))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) :rule or :premises (t2.t1))
% 0.16/0.46 (step t2.t3 (cl (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.16/0.46 (step t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X)))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) :rule subproof :discharge (t2.a0))
% 0.16/0.46 (step t3 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) :rule resolution :premises (t1 t2))
% 0.16/0.46 (step t4 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) (not (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule implies_neg2)
% 0.16/0.46 (step t5 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) (=> (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule resolution :premises (t3 t4))
% 0.16/0.46 (step t6 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule contraction :premises (t5))
% 0.16/0.46 (step t7 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_g X)) (tptp.big_h tptp.a X)))) (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) :rule implies :premises (t6))
% 0.16/0.46 (step t8 (cl (not (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a)))) (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a))) :rule or_pos)
% 0.16/0.46 (step t9 (cl (tptp.big_h tptp.a (tptp.g tptp.a)) (not (tptp.big_g (tptp.g tptp.a))) (not (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule reordering :premises (t8))
% 0.16/0.46 (step t10 (cl (not (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a)))) :rule or_pos)
% 0.16/0.46 (step t11 (cl (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))) (not (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a)))))) :rule reordering :premises (t10))
% 0.16/0.46 (step t12 (cl (not (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a)) :rule or_pos)
% 0.16/0.46 (step t13 (cl (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a) (not (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a)))) :rule reordering :premises (t12))
% 0.16/0.46 (step t14 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X)))) :rule implies_neg1)
% 0.16/0.46 (anchor :step t15)
% 0.16/0.46 (assume t15.a0 (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))))
% 0.16/0.46 (step t15.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X)))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a)))) :rule forall_inst :args ((:= X tptp.a)))
% 0.16/0.46 (step t15.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X)))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) :rule or :premises (t15.t1))
% 0.16/0.46 (step t15.t3 (cl (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) :rule resolution :premises (t15.t2 t15.a0))
% 0.16/0.46 (step t15 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X)))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) :rule subproof :discharge (t15.a0))
% 0.16/0.46 (step t16 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) :rule resolution :premises (t14 t15))
% 0.16/0.46 (step t17 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) (not (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a)))) :rule implies_neg2)
% 0.16/0.46 (step t18 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) (=> (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a)))) :rule resolution :premises (t16 t17))
% 0.16/0.46 (step t19 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a)))) :rule contraction :premises (t18))
% 0.16/0.46 (step t20 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_j X)) (tptp.big_f X)))) (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) :rule implies :premises (t19))
% 0.16/0.46 (step t21 (cl (or (not (tptp.big_j tptp.a)) (tptp.big_f tptp.a))) :rule resolution :premises (t20 a6))
% 0.16/0.46 (step t22 (cl (tptp.big_f tptp.a)) :rule resolution :premises (t13 a4 t21))
% 0.16/0.46 (step t23 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X)))))) :rule implies_neg1)
% 0.16/0.46 (anchor :step t24)
% 0.16/0.46 (assume t24.a0 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))))
% 0.16/0.46 (step t24.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X)))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a)))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.16/0.46 (step t24.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X)))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule or :premises (t24.t1))
% 0.16/0.46 (step t24.t3 (cl (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule resolution :premises (t24.t2 t24.a0))
% 0.16/0.46 (step t24 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X)))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule subproof :discharge (t24.a0))
% 0.16/0.46 (step t25 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule resolution :premises (t23 t24))
% 0.16/0.46 (step t26 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) (not (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a)))))) :rule implies_neg2)
% 0.16/0.46 (step t27 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a)))))) :rule resolution :premises (t25 t26))
% 0.16/0.46 (step t28 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a)))))) :rule contraction :premises (t27))
% 0.16/0.46 (step t29 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (not (tptp.big_h X (tptp.g X)))))) (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule implies :premises (t28))
% 0.16/0.46 (step t30 (cl (or (not (tptp.big_f tptp.a)) (not (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule resolution :premises (t29 a3))
% 0.16/0.46 (step t31 (cl (not (tptp.big_h tptp.a (tptp.g tptp.a)))) :rule resolution :premises (t11 t22 t30))
% 0.16/0.46 (step t32 (cl (not (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a))) :rule or_pos)
% 0.16/0.46 (step t33 (cl (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)) (not (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a))))) :rule reordering :premises (t32))
% 0.16/0.46 (step t34 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X))))) :rule implies_neg1)
% 0.16/0.46 (anchor :step t35)
% 0.16/0.46 (assume t35.a0 (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))))
% 0.16/0.46 (step t35.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.16/0.46 (step t35.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) :rule or :premises (t35.t1))
% 0.16/0.46 (step t35.t3 (cl (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) :rule resolution :premises (t35.t2 t35.a0))
% 0.16/0.46 (step t35 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) :rule subproof :discharge (t35.a0))
% 0.16/0.46 (step t36 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) :rule resolution :premises (t34 t35))
% 0.16/0.46 (step t37 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) (not (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a))))) :rule implies_neg2)
% 0.16/0.46 (step t38 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a))))) :rule resolution :premises (t36 t37))
% 0.16/0.46 (step t39 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X)))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a))))) :rule contraction :premises (t38))
% 0.16/0.46 (step t40 (cl (not (forall ((X $$unsorted)) (or (not (tptp.big_f X)) (tptp.big_g (tptp.g X))))) (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) :rule implies :premises (t39))
% 0.16/0.46 (step t41 (cl (or (not (tptp.big_f tptp.a)) (tptp.big_g (tptp.g tptp.a)))) :rule resolution :premises (t40 a2))
% 0.16/0.46 (step t42 (cl (tptp.big_g (tptp.g tptp.a))) :rule resolution :premises (t33 t22 t41))
% 0.16/0.46 (step t43 (cl (not (or (not (tptp.big_g (tptp.g tptp.a))) (tptp.big_h tptp.a (tptp.g tptp.a))))) :rule resolution :premises (t9 t31 t42))
% 0.16/0.46 (step t44 (cl) :rule resolution :premises (t7 t43 a5))
% 0.16/0.46
% 0.16/0.46 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.bVNjleknTx/cvc5---1.0.5_11338.smt2
% 0.16/0.47 % cvc5---1.0.5 exiting
% 0.16/0.47 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------