↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n010.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:19:34 AM UTC 2026

% Result   : Unsatisfiable 0.44s 0.64s
% Output   : Proof 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP008-1 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.35  % Computer : n010.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Tue Jun  2 00:39:40 EDT 2026
% 0.17/0.35  % CPUTime  : 
% 0.26/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.26/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.44/0.64  % SZS status Unsatisfiable
% 0.44/0.64  % SZS output start Proof
% 0.44/0.64  (
% 0.44/0.64  (declare-sort $$unsorted 0)
% 0.44/0.64  (declare-const tptp.j (-> $$unsorted $$unsorted))
% 0.44/0.64  (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted))
% 0.44/0.64  (declare-const tptp.h (-> $$unsorted $$unsorted))
% 0.44/0.64  (declare-const tptp.q (-> $$unsorted Bool))
% 0.44/0.64  (declare-const tptp.inverse (-> $$unsorted $$unsorted))
% 0.44/0.64  (declare-const tptp.product (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.44/0.64  (declare-const tptp.identity $$unsorted)
% 0.44/0.64  (define @t1 () (@var "X" $$unsorted))
% 0.44/0.64  (define @t2 () (@list @t1))
% 0.44/0.64  (define @t3 () (tptp.inverse @t1))
% 0.44/0.64  (define @t4 () (@var "Y" $$unsorted))
% 0.44/0.64  (define @t5 () (@var "W" $$unsorted))
% 0.44/0.64  (define @t6 () (@var "Z" $$unsorted))
% 0.44/0.64  (define @t7 () (forall (@list @t1 @t4 @t6 @t5) (or (not (tptp.product @t1 @t4 @t6)) (not (tptp.product @t1 @t4 @t5)) (= @t6 @t5))))
% 0.44/0.64  (define @t8 () (@var "V" $$unsorted))
% 0.44/0.64  (define @t9 () (tptp.product @t1 @t8 @t5))
% 0.44/0.64  (define @t10 () (@var "U" $$unsorted))
% 0.44/0.64  (define @t11 () (tptp.product @t10 @t6 @t5))
% 0.44/0.64  (define @t12 () (not (tptp.product @t4 @t6 @t8)))
% 0.44/0.64  (define @t13 () (not (tptp.product @t1 @t4 @t10)))
% 0.44/0.64  (define @t14 () (@list @t1 @t4 @t10 @t6 @t8 @t5))
% 0.44/0.64  (define @t15 () (@var "C" $$unsorted))
% 0.44/0.64  (define @t16 () (@var "A" $$unsorted))
% 0.44/0.64  (define @t17 () (@var "B" $$unsorted))
% 0.44/0.64  (define @t18 () (tptp.q @t16))
% 0.44/0.64  (define @t19 () (tptp.h @t16))
% 0.44/0.64  (define @t20 () (tptp.j @t16))
% 0.44/0.64  (define @t21 () (tptp.product @t16 @t20 @t19))
% 0.44/0.64  (define @t22 () (tptp.product @t20 @t16 @t19))
% 0.44/0.64  (define @t23 () (@list @t16))
% 0.44/0.64  (define @t24 () (tptp.q tptp.identity))
% 0.44/0.64  (define @t25 () (tptp.j tptp.identity))
% 0.44/0.64  (define @t26 () (@list tptp.identity))
% 0.44/0.64  (define @t27 () (tptp.h tptp.identity))
% 0.44/0.64  (define @t28 () (tptp.product tptp.identity @t25 @t27))
% 0.44/0.64  (define @t29 () (not @t28))
% 0.44/0.64  (define @t30 () (tptp.product @t25 tptp.identity @t27))
% 0.44/0.64  (define @t31 () (not @t30))
% 0.44/0.64  (define @t32 () (or @t31 @t29 @t24))
% 0.44/0.64  (define @t33 () (@list @t25))
% 0.44/0.64  (define @t34 () (tptp.inverse @t25))
% 0.44/0.64  (define @t35 () (tptp.product @t34 @t25 tptp.identity))
% 0.44/0.64  (define @t36 () (not @t35))
% 0.44/0.64  (define @t37 () (tptp.product @t25 @t34 tptp.identity))
% 0.44/0.64  (define @t38 () (not @t37))
% 0.44/0.64  (define @t39 () (or @t38 @t36 @t29 @t30))
% 0.44/0.64  (define @t40 () (tptp.multiply tptp.identity @t25))
% 0.44/0.64  (define @t41 () (= @t27 @t40))
% 0.44/0.64  (define @t42 () (not @t41))
% 0.44/0.64  (define @t43 () (tptp.product tptp.identity @t25 @t40))
% 0.44/0.64  (define @t44 () (not @t43))
% 0.44/0.64  (define @t45 () (and @t29 @t41 @t43))
% 0.44/0.64  (define @t46 () (tptp.product @t25 tptp.identity @t25))
% 0.44/0.64  (define @t47 () (not @t46))
% 0.44/0.64  (define @t48 () (or @t31 @t47 (= @t27 @t25)))
% 0.44/0.64  (define @t49 () (= @t25 @t27))
% 0.44/0.64  (define @t50 () (or @t31 @t47 @t49))
% 0.44/0.64  (define @t51 () (@list false))
% 0.44/0.64  (define @t52 () (@list @t7))
% 0.44/0.64  (define @t53 () (or @t30 @t28 @t24))
% 0.44/0.64  (define @t54 () (@list false false false))
% 0.44/0.64  (define @t55 () (tptp.product tptp.identity @t25 @t25))
% 0.44/0.64  (define @t56 () (not @t55))
% 0.44/0.64  (define @t57 () (or @t44 @t56 (= @t40 @t25)))
% 0.44/0.64  (define @t58 () (= @t25 @t40))
% 0.44/0.64  (define @t59 () (or @t44 @t56 @t58))
% 0.44/0.64  (define @t60 () (not @t58))
% 0.44/0.64  (define @t61 () (not @t49))
% 0.44/0.64  (define @t62 () (and @t42 @t49))
% 0.44/0.64  (assume @p1 (forall @t2 (tptp.product tptp.identity @t1 @t1)))
% 0.44/0.64  (assume @p2 (forall @t2 (tptp.product @t1 tptp.identity @t1)))
% 0.44/0.64  (assume @p3 (forall @t2 (tptp.product @t3 @t1 tptp.identity)))
% 0.44/0.64  (assume @p4 (forall @t2 (tptp.product @t1 @t3 tptp.identity)))
% 0.44/0.64  (assume @p5 (forall (@list @t1 @t4) (tptp.product @t1 @t4 (tptp.multiply @t1 @t4))))
% 0.44/0.64  (assume @p6 @t7)
% 0.44/0.64  (assume @p7 (forall @t14 (or @t13 @t12 (not @t11) @t9)))
% 0.44/0.64  (assume @p8 (forall @t14 (or @t13 @t12 (not @t9) @t11)))
% 0.44/0.64  (assume @p9 (forall (@list @t16 @t17 @t15) (or (not @t18) (not (tptp.product @t16 @t17 @t15)) (tptp.product @t17 @t16 @t15))))
% 0.44/0.64  (assume @p10 (forall @t23 (or @t22 @t21 @t18)))
% 0.44/0.64  (assume @p11 (forall @t23 (or (not @t22) (not @t21) @t18)))
% 0.44/0.64  (assume @p12 (not @t24))
% 0.44/0.64  (step @p13 :rule instantiate :premises (@p5) :args ((@list tptp.identity @t25)))
% 0.44/0.64  (step @p14 :rule instantiate :premises (@p11) :args (@t26))
% 0.44/0.64  (step @p15 :rule cnf_or_pos :args (@t32))
% 0.44/0.64  (step @p16 :rule reordering :premises (@p15) :args ((or @t24 @t31 @t29 (not @t32))))
% 0.44/0.64  (step @p17 :rule instantiate :premises (@p3) :args (@t33))
% 0.44/0.64  (step @p18 :rule instantiate :premises (@p4) :args (@t33))
% 0.44/0.64  (step @p19 :rule instantiate :premises (@p7) :args ((@list @t25 @t34 tptp.identity @t25 tptp.identity @t27)))
% 0.44/0.64  (step @p20 :rule cnf_or_pos :args (@t39))
% 0.44/0.64  (step @p21 :rule reordering :premises (@p20) :args ((or @t30 @t29 @t36 @t38 (not @t39))))
% 0.44/0.64  (step @p22 :rule chain_m_resolution :premises (@p21 @p19 @p18 @p17 @p16 @p14 @p12) :args (@t29 (@list false false false true false true) (@list @t39 @t37 @t35 @t30 @t32 @t24)))
% 0.44/0.64  (step @p23 :rule refl :args (@t42))
% 0.44/0.64  (step @p24 :rule refl :args (@t44))
% 0.44/0.64  (step @p25 :rule bool-double-not-elim :args (@t28))
% 0.44/0.64  (step @p26 :rule nary_cong :premises (@p25 @p24 @p23) :args ((or (not @t29) @t44 @t42)))
% 0.44/0.64  (assume-push @p119 @t29)
% 0.44/0.64  (assume-push @p120 @t41)
% 0.44/0.64  (assume-push @p121 @t43)
% 0.44/0.64  (step @p30 :rule evaluate :args ((= true false)))
% 0.44/0.64  (step @p31 :rule false_intro :premises (@p22))
% 0.44/0.64  (step @p32 :rule symm :premises (@p120))
% 0.44/0.64  (step @p33 :rule refl :args (@t25))
% 0.44/0.64  (step @p34 :rule refl :args (tptp.identity))
% 0.44/0.64  (step @p35 :rule cong :premises (@p34 @p33 @p32) :args (@t43))
% 0.44/0.64  (step @p36 :rule true_intro :premises (@p13))
% 0.44/0.64  (step @p37 :rule symm :premises (@p36))
% 0.44/0.64  (step @p38 :rule trans :premises (@p37 @p35 @p31))
% 0.44/0.64  (step @p39 false :rule eq_resolve :premises (@p38 @p30))
% 0.44/0.64  (step-pop @p122 :rule scope :premises (@p39))
% 0.44/0.64  (step-pop @p123 :rule scope :premises (@p122))
% 0.44/0.64  (step-pop @p124 :rule scope :premises (@p123))
% 0.44/0.64  (step @p40 :rule process_scope :premises (@p124) :args (false))
% 0.44/0.64  (assume-push @p125 @t29)
% 0.44/0.64  (assume-push @p126 @t43)
% 0.44/0.64  (assume-push @p127 @t41)
% 0.44/0.64  (step @p47 :rule and_intro :premises (@p22 @p127 @p13))
% 0.44/0.64  (step-pop @p128 :rule scope :premises (@p47))
% 0.44/0.64  (step-pop @p129 :rule scope :premises (@p128))
% 0.44/0.64  (step-pop @p130 :rule scope :premises (@p129))
% 0.44/0.64  (step @p48 :rule process_scope :premises (@p130) :args (@t45))
% 0.44/0.64  (step @p52 :rule implies_elim :premises (@p48))
% 0.44/0.64  (step @p53 :rule resolution :premises (@p52 @p40) :args (true @t45))
% 0.44/0.64  (step @p54 :rule not_and :premises (@p53))
% 0.44/0.64  (step @p55 :rule eq_resolve :premises (@p54 @p26))
% 0.44/0.64  (step @p56 :rule chain_m_resolution :premises (@p55 @p22 @p13) :args (@t42 (@list true false) (@list @t28 @t43)))
% 0.44/0.64  (step @p57 :rule eq-symm :args (@t27 @t25))
% 0.44/0.64  (step @p58 :rule refl :args (@t47))
% 0.44/0.64  (step @p59 :rule refl :args (@t31))
% 0.44/0.64  (step @p60 :rule nary_cong :premises (@p59 @p58 @p57) :args (@t48))
% 0.44/0.64  (step @p61 :rule refl :args (@t7))
% 0.44/0.64  (step @p62 :rule cong :premises (@p61 @p60) :args ((=> @t7 @t48)))
% 0.44/0.64  (assume-push @p131 @t7)
% 0.44/0.64  (step @p64 :rule instantiate :premises (@p6) :args ((@list @t25 tptp.identity @t27 @t25)))
% 0.44/0.64  (step-pop @p132 :rule scope :premises (@p64))
% 0.44/0.64  (step @p65 :rule process_scope :premises (@p132) :args (@t48))
% 0.44/0.64  (step @p67 :rule eq_resolve :premises (@p65 @p62))
% 0.44/0.64  (step @p68 :rule implies_elim :premises (@p67))
% 0.44/0.64  (step @p69 :rule chain_m_resolution :premises (@p68 @p6) :args (@t50 @t51 @t52))
% 0.44/0.64  (step @p70 :rule instantiate :premises (@p2) :args (@t33))
% 0.44/0.64  (step @p71 :rule instantiate :premises (@p10) :args (@t26))
% 0.44/0.64  (step @p72 :rule cnf_or_pos :args (@t53))
% 0.44/0.64  (step @p73 :rule reordering :premises (@p72) :args ((or @t24 @t30 @t28 (not @t53))))
% 0.44/0.64  (step @p74 :rule chain_m_resolution :premises (@p73 @p12 @p22 @p71) :args (@t30 (@list true true false) (@list @t24 @t28 @t53)))
% 0.44/0.64  (step @p75 :rule cnf_or_pos :args (@t50))
% 0.44/0.64  (step @p76 :rule reordering :premises (@p75) :args ((or @t31 @t47 @t49 (not @t50))))
% 0.44/0.64  (step @p77 :rule chain_m_resolution :premises (@p76 @p74 @p70 @p69) :args (@t49 @t54 (@list @t30 @t46 @t50)))
% 0.44/0.64  (step @p78 :rule eq-symm :args (@t40 @t25))
% 0.44/0.64  (step @p79 :rule refl :args (@t56))
% 0.44/0.64  (step @p80 :rule nary_cong :premises (@p24 @p79 @p78) :args (@t57))
% 0.44/0.64  (step @p81 :rule cong :premises (@p61 @p80) :args ((=> @t7 @t57)))
% 0.44/0.64  (assume-push @p133 @t7)
% 0.44/0.64  (step @p83 :rule instantiate :premises (@p6) :args ((@list tptp.identity @t25 @t40 @t25)))
% 0.44/0.64  (step-pop @p134 :rule scope :premises (@p83))
% 0.44/0.64  (step @p84 :rule process_scope :premises (@p134) :args (@t57))
% 0.44/0.64  (step @p86 :rule eq_resolve :premises (@p84 @p81))
% 0.44/0.64  (step @p87 :rule implies_elim :premises (@p86))
% 0.44/0.64  (step @p88 :rule chain_m_resolution :premises (@p87 @p6) :args (@t59 @t51 @t52))
% 0.44/0.64  (step @p89 :rule instantiate :premises (@p1) :args (@t33))
% 0.44/0.64  (step @p90 :rule cnf_or_pos :args (@t59))
% 0.44/0.64  (step @p91 :rule reordering :premises (@p90) :args ((or @t56 @t44 @t58 (not @t59))))
% 0.44/0.64  (step @p92 :rule chain_m_resolution :premises (@p91 @p89 @p13 @p88) :args (@t58 @t54 (@list @t55 @t43 @t59)))
% 0.44/0.64  (step @p93 :rule refl :args (@t60))
% 0.44/0.64  (step @p94 :rule refl :args (@t61))
% 0.44/0.64  (step @p95 :rule bool-double-not-elim :args (@t41))
% 0.44/0.64  (step @p96 :rule nary_cong :premises (@p95 @p94 @p93) :args ((or (not @t42) @t61 @t60)))
% 0.44/0.64  (assume-push @p135 @t42)
% 0.44/0.64  (assume-push @p136 @t49)
% 0.44/0.64  (assume-push @p137 @t42)
% 0.44/0.64  (assume-push @p138 @t49)
% 0.44/0.64  (step @p101 :rule false_intro :premises (@p135))
% 0.44/0.64  (step @p102 :rule refl :args (@t40))
% 0.44/0.64  (step @p103 :rule cong :premises (@p77 @p102) :args (@t58))
% 0.44/0.64  (step @p104 :rule trans :premises (@p103 @p101))
% 0.44/0.64  (step @p105 :rule false_elim :premises (@p104))
% 0.44/0.64  (step-pop @p139 :rule scope :premises (@p105))
% 0.44/0.64  (step-pop @p140 :rule scope :premises (@p139))
% 0.44/0.64  (step @p106 :rule process_scope :premises (@p140) :args (@t60))
% 0.44/0.64  (step @p109 :rule and_intro :premises (@p135 @p77))
% 0.44/0.64  (step @p110 :rule modus_ponens :premises (@p109 @p106))
% 0.44/0.64  (step-pop @p141 :rule scope :premises (@p110))
% 0.44/0.64  (step-pop @p142 :rule scope :premises (@p141))
% 0.44/0.64  (step @p111 :rule process_scope :premises (@p142) :args (@t60))
% 0.44/0.64  (step @p114 :rule implies_elim :premises (@p111))
% 0.44/0.64  (step @p115 :rule cnf_and_neg :args (@t62))
% 0.44/0.64  (step @p116 :rule resolution :premises (@p115 @p114) :args (true @t62))
% 0.44/0.64  (step @p117 :rule eq_resolve :premises (@p116 @p96))
% 0.44/0.64  (step @p118 false :rule chain_m_resolution :premises (@p117 @p92 @p77 @p56) :args (false (@list false false true) (@list @t58 @t49 @t41)))
% 0.44/0.64  )
% 0.44/0.65  % SZS output end Proof
% 0.44/0.65  % cvc5 exiting
%------------------------------------------------------------------------------