TSTP Solution File: SYN080-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN080-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n025.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:28 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN080-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue May 28 13:49:24 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.rIo5ZWvLCU/cvc5---1.0.5_16900.smt2
% 0.21/0.51 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.rIo5ZWvLCU/cvc5---1.0.5_16900.smt2
% 0.21/0.51 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))))
% 0.21/0.51 (assume a1 (not (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))))
% 0.21/0.51 (step t1 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule implies_neg1)
% 0.21/0.51 (anchor :step t2)
% 0.21/0.51 (assume t2.a0 (= (tptp.f tptp.a) (tptp.g tptp.b)))
% 0.21/0.51 (step t2.t1 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule implies_neg1)
% 0.21/0.51 (anchor :step t2.t2)
% 0.21/0.51 (assume t2.t2.a0 (= (tptp.f tptp.a) (tptp.g tptp.b)))
% 0.21/0.51 (step t2.t2.t1 (cl (= (tptp.g tptp.b) (tptp.f tptp.a))) :rule symm :premises (t2.t2.a0))
% 0.21/0.51 (step t2.t2.t2 (cl (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule symm :premises (t2.t2.t1))
% 0.21/0.51 (step t2.t2.t3 (cl (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule cong :premises (t2.t2.t2))
% 0.21/0.51 (step t2.t2 (cl (not (= (tptp.f tptp.a) (tptp.g tptp.b))) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule subproof :discharge (t2.t2.a0))
% 0.21/0.51 (step t2.t3 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule resolution :premises (t2.t1 t2.t2))
% 0.21/0.51 (step t2.t4 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (not (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b))))) :rule implies_neg2)
% 0.21/0.51 (step t2.t5 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b))))) :rule resolution :premises (t2.t3 t2.t4))
% 0.21/0.51 (step t2.t6 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b))))) :rule contraction :premises (t2.t5))
% 0.21/0.51 (step t2.t7 (cl (not (= (tptp.f tptp.a) (tptp.g tptp.b))) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule implies :premises (t2.t6))
% 0.21/0.51 (step t2.t8 (cl (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule resolution :premises (t2.t7 t2.a0))
% 0.21/0.51 (step t2 (cl (not (= (tptp.f tptp.a) (tptp.g tptp.b))) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule subproof :discharge (t2.a0))
% 0.21/0.51 (step t3 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule resolution :premises (t1 t2))
% 0.21/0.51 (step t4 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (not (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b))))) :rule implies_neg2)
% 0.21/0.51 (step t5 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b))))) :rule resolution :premises (t3 t4))
% 0.21/0.51 (step t6 (cl (=> (= (tptp.f tptp.a) (tptp.g tptp.b)) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b))))) :rule contraction :premises (t5))
% 0.21/0.51 (step t7 (cl (not (= (tptp.f tptp.a) (tptp.g tptp.b))) (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b)))) :rule implies :premises (t6))
% 0.21/0.51 (step t8 (cl (= (tptp.f (tptp.f tptp.a)) (tptp.f (tptp.g tptp.b))) (not (= (tptp.f tptp.a) (tptp.g tptp.b)))) :rule reordering :premises (t7))
% 0.21/0.51 (step t9 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))) (= (tptp.f tptp.a) (tptp.g tptp.b))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y)))) :rule implies_neg1)
% 0.21/0.51 (anchor :step t10)
% 0.21/0.51 (assume t10.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))))
% 0.21/0.51 (step t10.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y)))) (= (tptp.f tptp.a) (tptp.g tptp.b)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.b)))
% 0.21/0.51 (step t10.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y)))) (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule or :premises (t10.t1))
% 0.21/0.51 (step t10.t3 (cl (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule resolution :premises (t10.t2 t10.a0))
% 0.21/0.51 (step t10 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y)))) (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule subproof :discharge (t10.a0))
% 0.21/0.51 (step t11 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))) (= (tptp.f tptp.a) (tptp.g tptp.b))) (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule resolution :premises (t9 t10))
% 0.21/0.51 (step t12 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))) (= (tptp.f tptp.a) (tptp.g tptp.b))) (not (= (tptp.f tptp.a) (tptp.g tptp.b)))) :rule implies_neg2)
% 0.21/0.51 (step t13 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))) (= (tptp.f tptp.a) (tptp.g tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))) (= (tptp.f tptp.a) (tptp.g tptp.b)))) :rule resolution :premises (t11 t12))
% 0.21/0.51 (step t14 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y))) (= (tptp.f tptp.a) (tptp.g tptp.b)))) :rule contraction :premises (t13))
% 0.21/0.51 (step t15 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.f X) (tptp.g Y)))) (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule implies :premises (t14))
% 0.21/0.51 (step t16 (cl (= (tptp.f tptp.a) (tptp.g tptp.b))) :rule resolution :premises (t15 a0))
% 0.21/0.51 (step t17 (cl) :rule resolution :premises (t8 t16 a1))
% 0.21/0.51
% 0.21/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.rIo5ZWvLCU/cvc5---1.0.5_16900.smt2
% 0.21/0.52 % cvc5---1.0.5 exiting
% 0.21/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------