%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET020+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n011.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 : Thu Aug 31 14:36:51 EDT 2023

% Result   : Theorem 0.17s 0.50s
% Output   : Proof 0.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem    : SET020+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.05/0.12  % Command    : do_cvc5 %s %d
% 0.11/0.33  % Computer : n011.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   : Sat Aug 26 14:47:09 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.17/0.46  %----Proving TF0_NAR, FOF, or CNF
% 0.17/0.50  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.kfDIyuxaaB/cvc5---1.0.5_2562.p...
% 0.17/0.50  ------- get file name : TPTP file name is SET020+1
% 0.17/0.50  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_2562.smt2...
% 0.17/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.17/0.50  % SZS status Theorem for SET020+1
% 0.17/0.50  % SZS output start Proof for SET020+1
% 0.17/0.50  (
% 0.17/0.50  (let ((_let_1 (not (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted)) (=> (and (tptp.member U tptp.universal_class) (tptp.member V tptp.universal_class) (= X (tptp.ordered_pair U V))) (and (= (tptp.first X) U) (= (tptp.second X) V))))))) (let ((_let_2 (tptp.cross_product tptp.universal_class tptp.universal_class))) (let ((_let_3 (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.ordered_pair X Y))) (=> (and (tptp.member X tptp.universal_class) (tptp.member Y tptp.universal_class)) (and (= (tptp.first _let_1) X) (= (tptp.second _let_1) Y))))))) (let ((_let_4 (forall ((U $$unsorted) (V $$unsorted)) (let ((_let_1 (tptp.ordered_pair U V))) (or (not (tptp.member U tptp.universal_class)) (not (tptp.member V tptp.universal_class)) (and (= U (tptp.first _let_1)) (= V (tptp.second _let_1)))))))) (let ((_let_5 (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.ordered_pair X Y))) (or (not (tptp.member X tptp.universal_class)) (not (tptp.member Y tptp.universal_class)) (and (= X (tptp.first _let_1)) (= Y (tptp.second _let_1)))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_5 (= X U) (= Y V)))) :args ((or _let_4 (not _let_5)))) (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))) :args (_let_4 false _let_5)) :args (false false _let_4)) :args ((forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.subclass X Y) (forall ((U $$unsorted)) (=> (tptp.member U X) (tptp.member U Y))))) (forall ((X $$unsorted)) (tptp.subclass X tptp.universal_class)) (forall ((X $$unsorted) (Y $$unsorted)) (= (= X Y) (and (tptp.subclass X Y) (tptp.subclass Y X)))) (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.member U (tptp.unordered_pair X Y)) (and (tptp.member U tptp.universal_class) (or (= U X) (= U Y))))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.member (tptp.unordered_pair X Y) tptp.universal_class)) (forall ((X $$unsorted)) (= (tptp.singleton X) (tptp.unordered_pair X X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.ordered_pair X Y) (tptp.unordered_pair (tptp.singleton X) (tptp.unordered_pair X (tptp.singleton Y))))) (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.member (tptp.ordered_pair U V) (tptp.cross_product X Y)) (and (tptp.member U X) (tptp.member V Y)))) _let_3 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (tptp.member Z (tptp.cross_product X Y)) (= Z (tptp.ordered_pair (tptp.first Z) (tptp.second Z))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.member (tptp.ordered_pair X Y) tptp.element_relation) (and (tptp.member Y tptp.universal_class) (tptp.member X Y)))) (tptp.subclass tptp.element_relation _let_2) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.member Z (tptp.intersection X Y)) (and (tptp.member Z X) (tptp.member Z Y)))) (forall ((X $$unsorted) (Z $$unsorted)) (= (tptp.member Z (tptp.complement X)) (and (tptp.member Z tptp.universal_class) (not (tptp.member Z X))))) (forall ((X $$unsorted) (XR $$unsorted) (Y $$unsorted)) (= (tptp.restrict XR X Y) (tptp.intersection XR (tptp.cross_product X Y)))) (forall ((X $$unsorted)) (not (tptp.member X tptp.null_class))) (forall ((X $$unsorted) (Z $$unsorted)) (= (tptp.member Z (tptp.domain_of X)) (and (tptp.member Z tptp.universal_class) (not (= (tptp.restrict X (tptp.singleton Z) tptp.universal_class) tptp.null_class))))) (forall ((X $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (tptp.ordered_pair (tptp.ordered_pair U V) W))) (= (tptp.member _let_1 (tptp.rotate X)) (and (tptp.member _let_1 (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair V W) U) X))))) (forall ((X $$unsorted)) (tptp.subclass (tptp.rotate X) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.ordered_pair (tptp.ordered_pair U V) W))) (= (tptp.member _let_1 (tptp.flip X)) (and (tptp.member _let_1 (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair V U) W) X))))) (forall ((X $$unsorted)) (tptp.subclass (tptp.flip X) (tptp.cross_product (tptp.cross_product tptp.universal_class tptp.universal_class) tptp.universal_class))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.member Z (tptp.union X Y)) (or (tptp.member Z X) (tptp.member Z Y)))) (forall ((X $$unsorted)) (= (tptp.successor X) (tptp.union X (tptp.singleton X)))) (tptp.subclass tptp.successor_relation _let_2) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.member (tptp.ordered_pair X Y) tptp.successor_relation) (and (tptp.member X tptp.universal_class) (tptp.member Y tptp.universal_class) (= (tptp.successor X) Y)))) (forall ((Y $$unsorted)) (= (tptp.inverse Y) (tptp.domain_of (tptp.flip (tptp.cross_product Y tptp.universal_class))))) (forall ((Z $$unsorted)) (= (tptp.range_of Z) (tptp.domain_of (tptp.inverse Z)))) (forall ((X $$unsorted) (XR $$unsorted)) (= (tptp.image XR X) (tptp.range_of (tptp.restrict XR X tptp.universal_class)))) (forall ((X $$unsorted)) (= (tptp.inductive X) (and (tptp.member tptp.null_class X) (tptp.subclass (tptp.image tptp.successor_relation X) X)))) (exists ((X $$unsorted)) (and (tptp.member X tptp.universal_class) (tptp.inductive X) (forall ((Y $$unsorted)) (=> (tptp.inductive Y) (tptp.subclass X Y))))) (forall ((U $$unsorted) (X $$unsorted)) (= (tptp.member U (tptp.sum_class X)) (exists ((Y $$unsorted)) (and (tptp.member U Y) (tptp.member Y X))))) (forall ((X $$unsorted)) (=> (tptp.member X tptp.universal_class) (tptp.member (tptp.sum_class X) tptp.universal_class))) (forall ((U $$unsorted) (X $$unsorted)) (= (tptp.member U (tptp.power_class X)) (and (tptp.member U tptp.universal_class) (tptp.subclass U X)))) (forall ((U $$unsorted)) (=> (tptp.member U tptp.universal_class) (tptp.member (tptp.power_class U) tptp.universal_class))) (forall ((XR $$unsorted) (YR $$unsorted)) (tptp.subclass (tptp.compose YR XR) (tptp.cross_product tptp.universal_class tptp.universal_class))) (forall ((XR $$unsorted) (YR $$unsorted) (U $$unsorted) (V $$unsorted)) (= (tptp.member (tptp.ordered_pair U V) (tptp.compose YR XR)) (and (tptp.member U tptp.universal_class) (tptp.member V (tptp.image YR (tptp.image XR (tptp.singleton U))))))) (forall ((Z $$unsorted)) (= (tptp.member Z tptp.identity_relation) (exists ((X $$unsorted)) (and (tptp.member X tptp.universal_class) (= Z (tptp.ordered_pair X X)))))) (forall ((XF $$unsorted)) (= (tptp.function XF) (and (tptp.subclass XF (tptp.cross_product tptp.universal_class tptp.universal_class)) (tptp.subclass (tptp.compose XF (tptp.inverse XF)) tptp.identity_relation)))) (forall ((X $$unsorted) (XF $$unsorted)) (=> (and (tptp.member X tptp.universal_class) (tptp.function XF)) (tptp.member (tptp.image XF X) tptp.universal_class))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.disjoint X Y) (forall ((U $$unsorted)) (not (and (tptp.member U X) (tptp.member U Y)))))) (forall ((X $$unsorted)) (=> (not (= X tptp.null_class)) (exists ((U $$unsorted)) (and (tptp.member U tptp.universal_class) (tptp.member U X) (tptp.disjoint U X))))) (forall ((XF $$unsorted) (Y $$unsorted)) (= (tptp.apply XF Y) (tptp.sum_class (tptp.image XF (tptp.singleton Y))))) (exists ((XF $$unsorted)) (and (tptp.function XF) (forall ((Y $$unsorted)) (=> (tptp.member Y tptp.universal_class) (or (= Y tptp.null_class) (tptp.member (tptp.apply XF Y) Y)))))) _let_1 true))))))))
% 0.17/0.50  )
% 0.17/0.50  % SZS output end Proof for SET020+1
% 0.17/0.51  % cvc5---1.0.5 exiting
% 0.17/0.51  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------