%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SYN000_1 : TPTP v8.2.0. Released v5.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:23:35 EDT 2024

% Result   : Theorem 0.21s 0.53s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN000_1 : TPTP v8.2.0. Released v5.0.0.
% 0.12/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 14:09:39 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.53  % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.pQQ6VYw5yH/cvc5---1.0.5_11534.smt2
% 0.21/0.53  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.pQQ6VYw5yH/cvc5---1.0.5_11534.smt2
% 0.21/0.53  (assume a0 (=> (and tptp.p0 (not tptp.q0)) (or tptp.r0 (not tptp.s0))))
% 0.21/0.53  (assume a1 (forall ((X $$unsorted)) (=> (or (tptp.p X) (not (tptp.q X tptp.a))) (exists ((Y $$unsorted) (Z $$unsorted)) (and (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.21/0.53  (assume a2 (exists ((Y $$unsorted)) (forall ((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.21/0.53  (assume a3 (or true false))
% 0.21/0.53  (assume a4 (or |tptp.'A proposition'| (|tptp.'A predicate'| tptp.a) (tptp.p |tptp.'A constant'|) (tptp.p (|tptp.'A function'| tptp.a)) (tptp.p |tptp.'A _'quoted __ escape_''|)))
% 0.21/0.53  (assume a5 (forall ((X $$unsorted)) (= (=> (not (tptp.q X tptp.a)) (tptp.p X)) (exists ((Y $$unsorted) (Z $$unsorted)) (xor (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.21/0.53  (assume a6 (forall ((X tptp.new)) (tptp.newp (tptp.newf tptp.newc tptp.a) tptp.a)))
% 0.21/0.53  (assume a7 (forall ((X $$unsorted)) (=> (or (tptp.p X) (not (tptp.q X tptp.a))) (exists ((Y $$unsorted) (Z $$unsorted)) (and (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.21/0.53  (assume a8 (tptp.p tptp.h))
% 0.21/0.53  (assume a9 (not (exists ((X $$unsorted)) (tptp.p X))))
% 0.21/0.53  (assume a10 tptp.ia1)
% 0.21/0.53  (assume a11 tptp.ia2)
% 0.21/0.53  (assume a12 tptp.ia3)
% 0.21/0.53  (assume a13 true)
% 0.21/0.53  (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.21/0.53  (anchor :step t2)
% 0.21/0.53  (assume t2.a0 (forall ((X $$unsorted)) (not (tptp.p X))))
% 0.21/0.53  (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.21/0.53  (step t2.t2 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (tptp.p tptp.h))) :rule or :premises (t2.t1))
% 0.21/0.53  (step t2.t3 (cl (not (tptp.p tptp.h))) :rule resolution :premises (t2.t2 t2.a0))
% 0.21/0.53  (step t2 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (tptp.p tptp.h))) :rule subproof :discharge (t2.a0))
% 0.21/0.53  (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.21/0.53  (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.21/0.53  (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.21/0.53  (step t6 (cl (=> (forall ((X $$unsorted)) (not (tptp.p X))) (not (tptp.p tptp.h)))) :rule contraction :premises (t5))
% 0.21/0.53  (step t7 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (tptp.p tptp.h))) :rule implies :premises (t6))
% 0.21/0.53  (step t8 (cl (not (= (not (exists ((X $$unsorted)) (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (exists ((X $$unsorted)) (tptp.p X)))) (forall ((X $$unsorted)) (not (tptp.p X)))) :rule equiv_pos2)
% 0.21/0.53  (step t9 (cl (= (exists ((X $$unsorted)) (tptp.p X)) (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule all_simplify)
% 0.21/0.53  (step t10 (cl (= (not (exists ((X $$unsorted)) (tptp.p X))) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule cong :premises (t9))
% 0.21/0.53  (step t11 (cl (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule all_simplify)
% 0.21/0.53  (step t12 (cl (= (not (exists ((X $$unsorted)) (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule trans :premises (t10 t11))
% 0.21/0.53  (step t13 (cl (forall ((X $$unsorted)) (not (tptp.p X)))) :rule resolution :premises (t8 t12 a9))
% 0.21/0.53  (step t14 (cl) :rule resolution :premises (t7 t13 a8))
% 0.21/0.53  
% 0.21/0.53  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.pQQ6VYw5yH/cvc5---1.0.5_11534.smt2
% 0.21/0.53  % cvc5---1.0.5 exiting
% 0.21/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------