↑ Up

cvc5---1.3.4.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SWV817-1 : TPTP v9.2.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% 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 Jun  3 09:02:26 AM UTC 2026

% Result   : Unsatisfiable 0.30s 0.55s
% Output   : Proof 0.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV817-1 : TPTP v9.2.1. Released v4.1.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n025.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue Jun  2 21:15:01 EDT 2026
% 0.16/0.35  % CPUTime  : 
% 0.30/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.30/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.30/0.55  % SZS status Unsatisfiable
% 0.30/0.55  % SZS output start Proof
% 0.30/0.55  (
% 0.30/0.55  (declare-sort $$unsorted 0)
% 0.30/0.55  (declare-const tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 $$unsorted)
% 0.30/0.55  (declare-const tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1 $$unsorted)
% 0.30/0.55  (declare-const tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 $$unsorted)
% 0.30/0.55  (declare-const tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2 $$unsorted)
% 0.30/0.55  (declare-const tptp.c_Hoare__Mirabelle_Ostate__not__singleton Bool)
% 0.30/0.55  (declare-const tptp.t_a $$unsorted)
% 0.30/0.55  (declare-const tptp.v_x $$unsorted)
% 0.30/0.55  (declare-const tptp.c_Fun_Oid (-> $$unsorted $$unsorted $$unsorted))
% 0.30/0.55  (define @t1 () (@var "V_x" $$unsorted))
% 0.30/0.55  (define @t2 () (@var "T_a" $$unsorted))
% 0.30/0.55  (define @t3 () (not tptp.c_Hoare__Mirabelle_Ostate__not__singleton))
% 0.30/0.55  (define @t4 () (not (= tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1 tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2)))
% 0.30/0.55  (define @t5 () (or @t4 @t3))
% 0.30/0.55  (define @t6 () (@var "V_xa" $$unsorted))
% 0.30/0.55  (define @t7 () (@var "V_s" $$unsorted))
% 0.30/0.55  (define @t8 () (forall (@list @t7) (= @t7 tptp.v_x)))
% 0.30/0.55  (define @t9 () (not (= tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2 tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1)))
% 0.30/0.55  (assume @p1 (forall (@list @t1 @t2) (= (tptp.c_Fun_Oid @t1 @t2) @t1)))
% 0.30/0.55  (assume @p2 (= (tptp.c_Fun_Oid tptp.v_x tptp.t_a) tptp.v_x))
% 0.30/0.55  (assume @p3 @t5)
% 0.30/0.55  (assume @p4 (forall (@list @t1 @t6) (or tptp.c_Hoare__Mirabelle_Ostate__not__singleton (= @t1 @t6))))
% 0.30/0.55  (assume @p5 (or (not (= tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2)) @t3))
% 0.30/0.55  (assume @p6 tptp.c_Hoare__Mirabelle_Ostate__not__singleton)
% 0.30/0.55  (assume @p7 @t8)
% 0.30/0.55  (step @p8 :rule evaluate :args ((= false true)))
% 0.30/0.55  (step @p9 :rule symm :premises (@p2))
% 0.30/0.55  (step @p10 :rule eq-symm :args (@t7 tptp.v_x))
% 0.30/0.55  (step @p11 :rule cong :premises (@p10) :args (@t8))
% 0.30/0.55  (step @p12 :rule eq_resolve :premises (@p7 @p11))
% 0.30/0.55  (step @p13 :rule instantiate :premises (@p12) :args ((@list tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1)))
% 0.30/0.55  (step @p14 :rule symm :premises (@p13))
% 0.30/0.55  (step @p15 :rule trans :premises (@p14 @p9))
% 0.30/0.55  (step @p16 :rule symm :premises (@p15))
% 0.30/0.55  (step @p17 :rule instantiate :premises (@p12) :args ((@list tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2)))
% 0.30/0.55  (step @p18 :rule symm :premises (@p17))
% 0.30/0.55  (step @p19 :rule trans :premises (@p18 @p9 @p16))
% 0.30/0.55  (step @p20 :rule true_intro :premises (@p19))
% 0.30/0.55  (step @p21 :rule refl :args (@t3))
% 0.30/0.55  (step @p22 :rule eq-symm :args (tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1 tptp.v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2))
% 0.30/0.55  (step @p23 :rule cong :premises (@p22) :args (@t4))
% 0.30/0.55  (step @p24 :rule nary_cong :premises (@p23 @p21) :args (@t5))
% 0.30/0.55  (step @p25 :rule eq_resolve :premises (@p3 @p24))
% 0.30/0.55  (step @p26 :rule reordering :premises (@p25) :args ((or @t3 @t9)))
% 0.30/0.55  (step @p27 :rule chain_m_resolution :premises (@p26 @p6) :args (@t9 (@list false) (@list tptp.c_Hoare__Mirabelle_Ostate__not__singleton)))
% 0.30/0.55  (step @p28 :rule false_intro :premises (@p27))
% 0.30/0.55  (step @p29 :rule symm :premises (@p28))
% 0.30/0.55  (step @p30 :rule trans :premises (@p29 @p20))
% 0.30/0.55  (step @p31 false :rule eq_resolve :premises (@p30 @p8))
% 0.30/0.55  )
% 0.30/0.56  % SZS output end Proof
% 0.30/0.56  % cvc5 exiting
%------------------------------------------------------------------------------