TSTP Solution File: SYN000-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN000-1 : TPTP v8.2.0. Released v4.0.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:23:37 EDT 2024
% Result : Unsatisfiable 0.23s 0.59s
% Output : Proof 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16 % Problem : SYN000-1 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.17 % Command : do_cvc5 %s %d
% 0.16/0.39 % Computer : n022.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 300
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Tue May 28 12:59:09 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.23/0.56 %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.23/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.iQaOkzfpQL/cvc5---1.0.5_15916.smt2
% 0.23/0.59 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.iQaOkzfpQL/cvc5---1.0.5_15916.smt2
% 0.39/0.59 (assume a0 (or tptp.p0 (not tptp.q0) tptp.r0 (not tptp.s0)))
% 0.39/0.59 (assume a1 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (tptp.p X) (not (tptp.q X tptp.a)) (tptp.r X (tptp.f Y) (tptp.g X (tptp.f Y) Z)) (not (tptp.s (tptp.f (tptp.f (tptp.f tptp.b))))))))
% 0.39/0.59 (assume a2 (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (= (tptp.f Y) (tptp.g X (tptp.f Y) Z)) (not (= (tptp.f (tptp.f (tptp.f tptp.b))) tptp.a)) (= X (tptp.f Y)))))
% 0.39/0.59 (assume a3 (or true false))
% 0.39/0.59 (assume a4 (forall ((Y $$unsorted)) (or |tptp.'A proposition'| (|tptp.'A predicate'| Y) (tptp.p |tptp.'A constant'|) (tptp.p (|tptp.'A function'| tptp.a)) (tptp.p |tptp.'A _'quoted __ escape_''|))))
% 0.39/0.59 (assume a5 (= (to_real 123) ($$utr ($$rtu (to_real 123)))))
% 0.39/0.59 (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (tptp.p X) (not (tptp.q X tptp.a)) (tptp.r X (tptp.f Y) (tptp.g X (tptp.f Y) Z)) (not (tptp.s (tptp.f (tptp.f (tptp.f tptp.b))))))))
% 0.39/0.59 (assume a7 (tptp.p tptp.h))
% 0.39/0.59 (assume a8 (forall ((X $$unsorted)) (not (tptp.p X))))
% 0.39/0.59 (assume a9 tptp.ia1)
% 0.39/0.59 (assume a10 tptp.ia2)
% 0.39/0.59 (assume a11 tptp.ia3)
% 0.39/0.59 (step t1 (cl (=> (forall ((X $$unsorted)) (not (tptp.p X))) (not (tptp.p tptp.h))) (forall ((X $$unsorted)) (not (tptp.p X)))) :rule implies_neg1)
% 0.39/0.59 (anchor :step t2)
% 0.39/0.59 (assume t2.a0 (forall ((X $$unsorted)) (not (tptp.p X))))
% 0.39/0.59 (step t2.t1 (cl (or (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (tptp.p tptp.h)))) :rule forall_inst :args ((:= X tptp.h)))
% 0.39/0.59 (step t2.t2 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (tptp.p tptp.h))) :rule or :premises (t2.t1))
% 0.39/0.59 (step t2.t3 (cl (not (tptp.p tptp.h))) :rule resolution :premises (t2.t2 t2.a0))
% 0.39/0.59 (step t2 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (tptp.p tptp.h))) :rule subproof :discharge (t2.a0))
% 0.39/0.59 (step t3 (cl (=> (forall ((X $$unsorted)) (not (tptp.p X))) (not (tptp.p tptp.h))) (not (tptp.p tptp.h))) :rule resolution :premises (t1 t2))
% 0.39/0.59 (step t4 (cl (=> (forall ((X $$unsorted)) (not (tptp.p X))) (not (tptp.p tptp.h))) (not (not (tptp.p tptp.h)))) :rule implies_neg2)
% 0.39/0.59 (step t5 (cl (=> (forall ((X $$unsorted)) (not (tptp.p X))) (not (tptp.p tptp.h))) (=> (forall ((X $$unsorted)) (not (tptp.p X))) (not (tptp.p tptp.h)))) :rule resolution :premises (t3 t4))
% 0.39/0.59 (step t6 (cl (=> (forall ((X $$unsorted)) (not (tptp.p X))) (not (tptp.p tptp.h)))) :rule contraction :premises (t5))
% 0.39/0.59 (step t7 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (tptp.p tptp.h))) :rule implies :premises (t6))
% 0.39/0.59 (step t8 (cl (not (tptp.p tptp.h)) (not (forall ((X $$unsorted)) (not (tptp.p X))))) :rule reordering :premises (t7))
% 0.39/0.59 (step t9 (cl) :rule resolution :premises (t8 a8 a7))
% 0.39/0.59
% 0.39/0.59 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.iQaOkzfpQL/cvc5---1.0.5_15916.smt2
% 0.39/0.59 % cvc5---1.0.5 exiting
% 0.39/0.60 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------