%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU165+1 : TPTP v9.2.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n007.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 Jun 3 08:50:48 AM UTC 2026 % Result : Theorem 0.37s 0.56s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SEU165+1 : TPTP v9.2.1. Released v3.3.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.35 % Computer : n007.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Tue Jun 2 16:32:41 EDT 2026 % 0.18/0.35 % CPUTime : % 0.28/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.37/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.37/0.56 % SZS status Theorem % 0.37/0.56 % SZS output start Proof % 0.37/0.56 ( % 0.37/0.56 (declare-sort $$unsorted 0) % 0.37/0.56 (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.56 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.37/0.56 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.37/0.56 (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.56 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.37/0.56 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.56 (define @t1 () (@var "A" $$unsorted)) % 0.37/0.56 (define @t2 () (@var "B" $$unsorted)) % 0.37/0.56 (define @t3 () (tptp.unordered_pair @t1 @t2)) % 0.37/0.56 (define @t4 () (@list @t1 @t2)) % 0.37/0.56 (define @t5 () (tptp.empty @t1)) % 0.37/0.56 (define @t6 () (@list @t1)) % 0.37/0.56 (define @t7 () (tptp.ordered_pair @t1 @t2)) % 0.37/0.56 (define @t8 () (@var "D" $$unsorted)) % 0.37/0.56 (define @t9 () (@var "C" $$unsorted)) % 0.37/0.56 (define @t10 () (forall (@list @t1 @t2 @t9 @t8) (= (tptp.in @t7 (tptp.cartesian_product2 @t9 @t8)) (and (tptp.in @t1 @t9) (tptp.in @t2 @t8))))) % 0.37/0.56 (assume @p1 (forall @t4 (= @t3 (tptp.unordered_pair @t2 @t1)))) % 0.37/0.56 (assume @p2 true) % 0.37/0.56 (assume @p3 (exists @t6 @t5)) % 0.37/0.56 (assume @p4 (exists @t6 (not @t5))) % 0.37/0.56 (assume @p5 (forall @t4 (=> (tptp.in @t1 @t2) (not (tptp.in @t2 @t1))))) % 0.37/0.56 (assume @p6 (forall @t4 (not (tptp.empty @t7)))) % 0.37/0.56 (assume @p7 (forall @t4 (= @t7 (tptp.unordered_pair @t3 (tptp.singleton @t1))))) % 0.37/0.56 (assume @p8 (not @t10)) % 0.37/0.56 (assume @p9 @t10) % 0.37/0.56 (step @p10 false :rule chain_m_resolution :premises (@p9 @p8) :args (false (@list true) (@list @t10))) % 0.37/0.56 ) % 0.37/0.56 % SZS output end Proof % 0.37/0.56 % cvc5 exiting %------------------------------------------------------------------------------