↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n012.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:08:44 AM UTC 2026

% Result   : Theorem 0.16s 0.37s
% Output   : Proof 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : SYN378+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.07  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.25  % Computer : n012.cluster.edu
% 0.08/0.25  % Model    : x86_64 x86_64
% 0.08/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.25  % Memory   : 8042.1875MB
% 0.08/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.25  % CPULimit : 300
% 0.08/0.25  % WCLimit  : 300
% 0.08/0.25  % DateTime : Tue Jun  2 23:25:33 EDT 2026
% 0.08/0.25  % CPUTime  : 
% 0.16/0.34  %----Proving TF0_NAR, FOF, or CNF
% 0.16/0.37  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.16/0.37  % SZS status Theorem
% 0.16/0.37  % SZS output start Proof
% 0.16/0.37  (
% 0.16/0.37  (declare-sort $$unsorted 0)
% 0.16/0.37  (declare-const tptp.big_p (-> $$unsorted Bool))
% 0.16/0.37  (declare-const tptp.big_q (-> $$unsorted Bool))
% 0.16/0.37  (define @t1 () (@var "Z" $$unsorted))
% 0.16/0.37  (define @t2 () (tptp.big_q @t1))
% 0.16/0.37  (define @t3 () (tptp.big_p @t1))
% 0.16/0.37  (define @t4 () (=> @t3 @t2))
% 0.16/0.37  (define @t5 () (@list @t1))
% 0.16/0.37  (define @t6 () (exists @t5 @t4))
% 0.16/0.37  (define @t7 () (@var "Y" $$unsorted))
% 0.16/0.37  (define @t8 () (tptp.big_q @t7))
% 0.16/0.37  (define @t9 () (@list @t7))
% 0.16/0.37  (define @t10 () (exists @t9 @t8))
% 0.16/0.37  (define @t11 () (not @t10))
% 0.16/0.37  (define @t12 () (or @t11 @t6))
% 0.16/0.37  (define @t13 () (@var "X" $$unsorted))
% 0.16/0.37  (define @t14 () (forall (@list @t13) (tptp.big_p @t13)))
% 0.16/0.37  (define @t15 () (=> @t14 @t12))
% 0.16/0.37  (define @t16 () (not @t15))
% 0.16/0.37  (define @t17 () (not @t2))
% 0.16/0.37  (define @t18 () (forall @t5 @t17))
% 0.16/0.37  (define @t19 () (@list @t1))
% 0.16/0.37  (define @t20 () (@var "BOUND_VARIABLE_7443" $$unsorted))
% 0.16/0.37  (define @t21 () (@list @t20))
% 0.16/0.37  (define @t22 () (forall @t5 @t3))
% 0.16/0.37  (define @t23 () (and @t22 @t18))
% 0.16/0.37  (define @t24 () (forall @t5 (not @t4)))
% 0.16/0.37  (define @t25 () (not @t24))
% 0.16/0.37  (define @t26 () (forall @t9 (not @t8)))
% 0.16/0.37  (define @t27 () (forall (@list @t20) (not (tptp.big_q @t20))))
% 0.16/0.37  (define @t28 () (@list true))
% 0.16/0.37  (assume @p1 @t16)
% 0.16/0.37  (assume @p2 true)
% 0.16/0.37  (step @p3 :rule alpha_equiv :args (@t18 @t19 @t21))
% 0.16/0.37  (step @p4 :rule alpha_equiv :args (@t22 @t19 (@list (@var "BOUND_VARIABLE_7438" $$unsorted))))
% 0.16/0.37  (step @p5 :rule nary_cong :premises (@p4 @p3) :args (@t23))
% 0.16/0.37  (step @p6 :rule quant-miniscope-and :args ((= (forall @t5 (and @t3 @t17)) @t23)))
% 0.16/0.37  (step @p7 :rule trans :premises (@p6 @p5))
% 0.16/0.37  (step @p8 :rule bool-implies-de-morgan :args (@t3 @t2))
% 0.16/0.37  (step @p9 :rule cong :premises (@p8) :args (@t24))
% 0.16/0.37  (step @p10 :rule trans :premises (@p9 @p7))
% 0.16/0.37  (step @p11 :rule cong :premises (@p10) :args (@t25))
% 0.16/0.37  (step @p12 :rule exists-elim :args ((= @t6 @t25)))
% 0.16/0.37  (step @p13 :rule trans :premises (@p12 @p11))
% 0.16/0.37  (step @p14 :rule bool-double-not-elim :args (@t26))
% 0.16/0.37  (step @p15 :rule exists-elim :args ((= @t10 (not @t26))))
% 0.16/0.37  (step @p16 :rule cong :premises (@p15) :args (@t11))
% 0.16/0.37  (step @p17 :rule trans :premises (@p16 @p14))
% 0.16/0.37  (step @p18 :rule nary_cong :premises (@p17 @p13) :args (@t12))
% 0.16/0.37  (step @p19 :rule refl :args (@t14))
% 0.16/0.37  (step @p20 :rule cong :premises (@p19 @p18) :args (@t15))
% 0.16/0.37  (step @p21 :rule cong :premises (@p20) :args (@t16))
% 0.16/0.37  (step @p22 :rule eq_resolve :premises (@p1 @p21))
% 0.16/0.37  (step @p23 :rule not_implies_elim2 :premises (@p22))
% 0.16/0.37  (step @p24 :rule not_or_elim :premises (@p23) :args (0))
% 0.16/0.37  (step @p25 :rule alpha_equiv :args (@t26 (@list @t7) @t21))
% 0.16/0.37  (step @p26 :rule equiv_elim2 :premises (@p25))
% 0.16/0.37  (step @p27 :rule chain_m_resolution :premises (@p26 @p24) :args ((not @t27) @t28 (@list @t26)))
% 0.16/0.37  (step @p28 :rule not_or_elim :premises (@p23) :args (1))
% 0.16/0.37  (step @p29 :rule not_not_elim :premises (@p28))
% 0.16/0.37  (step @p30 :rule and_elim :premises (@p29) :args (1))
% 0.16/0.37  (step @p31 false :rule chain_m_resolution :premises (@p30 @p27) :args (false @t28 (@list @t27)))
% 0.16/0.37  )
% 0.16/0.37  % SZS output end Proof
% 0.16/0.37  % cvc5 exiting
%------------------------------------------------------------------------------