↑ Up

cvc5---1.3.4.THM-Prf.s

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

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

% Result   : Theorem 0.30s 0.54s
% Output   : Proof 0.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN958+1 : TPTP v9.2.1. Released v3.1.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n021.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 23:51:20 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.30/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.30/0.54  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.30/0.54  % SZS status Theorem
% 0.30/0.54  % SZS output start Proof
% 0.30/0.54  (
% 0.30/0.54  (declare-sort $$unsorted 0)
% 0.30/0.54  (declare-const tptp.a (-> $$unsorted Bool))
% 0.30/0.54  (declare-const tptp.b (-> $$unsorted Bool))
% 0.30/0.54  (define @t1 () (@var "X" $$unsorted))
% 0.30/0.54  (define @t2 () (tptp.b @t1))
% 0.30/0.54  (define @t3 () (tptp.a @t1))
% 0.30/0.54  (define @t4 () (and @t3 @t2))
% 0.30/0.54  (define @t5 () (@list @t1))
% 0.30/0.54  (define @t6 () (exists @t5 @t4))
% 0.30/0.54  (define @t7 () (forall @t5 @t2))
% 0.30/0.54  (define @t8 () (exists @t5 @t3))
% 0.30/0.54  (define @t9 () (and @t8 @t7))
% 0.30/0.54  (define @t10 () (=> @t9 @t6))
% 0.30/0.54  (define @t11 () (not @t10))
% 0.30/0.54  (define @t12 () (forall @t5 (not @t4)))
% 0.30/0.54  (define @t13 () (not @t12))
% 0.30/0.54  (define @t14 () (forall @t5 (not @t3)))
% 0.30/0.54  (define @t15 () (not @t14))
% 0.30/0.54  (define @t16 () (@quantifiers_skolemize @t14 0))
% 0.30/0.54  (define @t17 () (@list @t16))
% 0.30/0.54  (define @t18 () (tptp.a @t16))
% 0.30/0.54  (define @t19 () (not @t18))
% 0.30/0.54  (define @t20 () (not @t19))
% 0.30/0.54  (define @t21 () (tptp.b @t16))
% 0.30/0.54  (define @t22 () (not @t21))
% 0.30/0.54  (define @t23 () (or @t19 @t22))
% 0.30/0.54  (assume @p1 @t11)
% 0.30/0.54  (assume @p2 true)
% 0.30/0.54  (step @p3 :rule bool-and-de-morgan :args (@t3 @t2 true))
% 0.30/0.54  (step @p4 :rule cong :premises (@p3) :args (@t12))
% 0.30/0.54  (step @p5 :rule cong :premises (@p4) :args (@t13))
% 0.30/0.54  (step @p6 :rule exists-elim :args ((= @t6 @t13)))
% 0.30/0.54  (step @p7 :rule trans :premises (@p6 @p5))
% 0.30/0.54  (step @p8 :rule refl :args (@t7))
% 0.30/0.54  (step @p9 :rule exists-elim :args ((= @t8 @t15)))
% 0.30/0.54  (step @p10 :rule nary_cong :premises (@p9 @p8) :args (@t9))
% 0.30/0.54  (step @p11 :rule cong :premises (@p10 @p7) :args (@t10))
% 0.30/0.54  (step @p12 :rule cong :premises (@p11) :args (@t11))
% 0.30/0.54  (step @p13 :rule eq_resolve :premises (@p1 @p12))
% 0.30/0.54  (step @p14 :rule not_implies_elim1 :premises (@p13))
% 0.30/0.54  (step @p15 :rule and_elim :premises (@p14) :args (1))
% 0.30/0.54  (step @p16 :rule not_implies_elim2 :premises (@p13))
% 0.30/0.54  (step @p17 :rule not_not_elim :premises (@p16))
% 0.30/0.54  (step @p18 :rule instantiate :premises (@p17) :args (@t17))
% 0.30/0.54  (step @p19 :rule and_elim :premises (@p14) :args (0))
% 0.30/0.54  (step @p20 :rule refl :args (@t18))
% 0.30/0.54  (step @p21 :rule bool-double-not-elim :args (@t14))
% 0.30/0.54  (step @p22 :rule nary_cong :premises (@p21 @p20) :args ((or (not @t15) @t18)))
% 0.30/0.54  (step @p23 :rule bool-double-not-elim :args (@t18))
% 0.30/0.54  (step @p24 :rule refl :args (@t15))
% 0.30/0.54  (step @p25 :rule cong :premises (@p24 @p23) :args ((=> @t15 @t20)))
% 0.30/0.54  (assume-push @p43 @t15)
% 0.30/0.54  (step @p27 :rule skolemize :premises (@p19))
% 0.30/0.54  (step-pop @p44 :rule scope :premises (@p27))
% 0.30/0.54  (step @p28 :rule process_scope :premises (@p44) :args (@t20))
% 0.30/0.54  (step @p30 :rule eq_resolve :premises (@p28 @p25))
% 0.30/0.54  (step @p31 :rule implies_elim :premises (@p30))
% 0.30/0.54  (step @p32 :rule eq_resolve :premises (@p31 @p22))
% 0.30/0.54  (step @p33 :rule chain_m_resolution :premises (@p32 @p19) :args (@t18 (@list true) (@list @t14)))
% 0.30/0.54  (step @p34 :rule cnf_or_pos :args (@t23))
% 0.30/0.54  (step @p35 :rule reordering :premises (@p34) :args ((or @t19 @t22 (not @t23))))
% 0.30/0.54  (step @p36 :rule chain_m_resolution :premises (@p35 @p33 @p18) :args (@t22 (@list false false) (@list @t18 @t23)))
% 0.30/0.54  (assume-push @p45 @t7)
% 0.30/0.54  (step @p38 :rule instantiate :premises (@p15) :args (@t17))
% 0.30/0.54  (step-pop @p46 :rule scope :premises (@p38))
% 0.30/0.54  (step @p39 :rule process_scope :premises (@p46) :args (@t21))
% 0.30/0.54  (step @p41 :rule implies_elim :premises (@p39))
% 0.30/0.54  (step @p42 false :rule chain_m_resolution :premises (@p41 @p36 @p15) :args (false (@list true false) (@list @t21 @t7)))
% 0.30/0.54  )
% 0.30/0.54  % SZS output end Proof
% 0.30/0.54  % cvc5 exiting
%------------------------------------------------------------------------------