↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n024.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:20:01 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.36s
% Output   : Proof 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : GRP145-1 : TPTP v9.2.1. Bugfixed v1.2.1.
% 0.00/0.07  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.25  % Computer : n024.cluster.edu
% 0.07/0.25  % Model    : x86_64 x86_64
% 0.07/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25  % Memory   : 8042.1875MB
% 0.07/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25  % CPULimit : 300
% 0.07/0.25  % WCLimit  : 300
% 0.07/0.25  % DateTime : Mon Jun  1 19:53:45 EDT 2026
% 0.07/0.25  % CPUTime  : 
% 0.18/0.33  %----Proving TF0_NAR, FOF, or CNF
% 0.18/0.34  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.18/0.36  % SZS status Unsatisfiable
% 0.18/0.36  % SZS output start Proof
% 0.18/0.36  (
% 0.18/0.36  (declare-sort $$unsorted 0)
% 0.18/0.36  (declare-const tptp.a $$unsorted)
% 0.18/0.36  (declare-const tptp.b $$unsorted)
% 0.18/0.36  (declare-const tptp.least_upper_bound (-> $$unsorted $$unsorted $$unsorted))
% 0.18/0.36  (declare-const tptp.greatest_lower_bound (-> $$unsorted $$unsorted $$unsorted))
% 0.18/0.36  (declare-const tptp.inverse (-> $$unsorted $$unsorted))
% 0.18/0.36  (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted))
% 0.18/0.36  (declare-const tptp.identity $$unsorted)
% 0.18/0.36  (define @t1 () (@var "X" $$unsorted))
% 0.18/0.36  (define @t2 () (@list @t1))
% 0.18/0.36  (define @t3 () (@var "Z" $$unsorted))
% 0.18/0.36  (define @t4 () (@var "Y" $$unsorted))
% 0.18/0.36  (define @t5 () (tptp.multiply @t1 @t4))
% 0.18/0.36  (define @t6 () (@list @t1 @t4 @t3))
% 0.18/0.36  (define @t7 () (tptp.greatest_lower_bound @t1 @t4))
% 0.18/0.36  (define @t8 () (@list @t1 @t4))
% 0.18/0.36  (define @t9 () (tptp.least_upper_bound @t1 @t4))
% 0.18/0.36  (define @t10 () (tptp.greatest_lower_bound @t4 @t3))
% 0.18/0.36  (define @t11 () (forall @t6 (= (tptp.greatest_lower_bound @t1 @t10) (tptp.greatest_lower_bound @t7 @t3))))
% 0.18/0.36  (define @t12 () (tptp.least_upper_bound @t4 @t3))
% 0.18/0.36  (define @t13 () (tptp.greatest_lower_bound @t1 @t1))
% 0.18/0.36  (define @t14 () (forall @t2 (= @t13 @t1)))
% 0.18/0.36  (define @t15 () (tptp.multiply @t1 @t3))
% 0.18/0.36  (define @t16 () (tptp.multiply @t3 @t1))
% 0.18/0.36  (define @t17 () (tptp.multiply @t4 @t1))
% 0.18/0.36  (define @t18 () (@list @t4 @t3 @t1))
% 0.18/0.36  (define @t19 () (tptp.greatest_lower_bound tptp.a tptp.b))
% 0.18/0.36  (define @t20 () (tptp.greatest_lower_bound @t19 tptp.b))
% 0.18/0.36  (define @t21 () (tptp.greatest_lower_bound tptp.b tptp.b))
% 0.18/0.36  (define @t22 () (tptp.greatest_lower_bound tptp.a @t21))
% 0.18/0.36  (define @t23 () (= @t22 @t20))
% 0.18/0.36  (define @t24 () (@list tptp.a tptp.b tptp.b))
% 0.18/0.36  (define @t25 () (= @t20 @t22))
% 0.18/0.36  (define @t26 () (= tptp.b @t21))
% 0.18/0.36  (define @t27 () (= @t19 @t20))
% 0.18/0.36  (define @t28 () (and @t25 @t26))
% 0.18/0.36  (assume @p1 (forall @t2 (= (tptp.multiply tptp.identity @t1) @t1)))
% 0.18/0.36  (assume @p2 (forall @t2 (= (tptp.multiply (tptp.inverse @t1) @t1) tptp.identity)))
% 0.18/0.36  (assume @p3 (forall @t6 (= (tptp.multiply @t5 @t3) (tptp.multiply @t1 (tptp.multiply @t4 @t3)))))
% 0.18/0.36  (assume @p4 (forall @t8 (= @t7 (tptp.greatest_lower_bound @t4 @t1))))
% 0.18/0.36  (assume @p5 (forall @t8 (= @t9 (tptp.least_upper_bound @t4 @t1))))
% 0.18/0.36  (assume @p6 @t11)
% 0.18/0.36  (assume @p7 (forall @t6 (= (tptp.least_upper_bound @t1 @t12) (tptp.least_upper_bound @t9 @t3))))
% 0.18/0.36  (assume @p8 (forall @t2 (= (tptp.least_upper_bound @t1 @t1) @t1)))
% 0.18/0.36  (assume @p9 @t14)
% 0.18/0.36  (assume @p10 (forall @t8 (= (tptp.least_upper_bound @t1 @t7) @t1)))
% 0.18/0.36  (assume @p11 (forall @t8 (= (tptp.greatest_lower_bound @t1 @t9) @t1)))
% 0.18/0.36  (assume @p12 (forall @t6 (= (tptp.multiply @t1 @t12) (tptp.least_upper_bound @t5 @t15))))
% 0.18/0.36  (assume @p13 (forall @t6 (= (tptp.multiply @t1 @t10) (tptp.greatest_lower_bound @t5 @t15))))
% 0.18/0.36  (assume @p14 (forall @t18 (= (tptp.multiply @t12 @t1) (tptp.least_upper_bound @t17 @t16))))
% 0.18/0.36  (assume @p15 (forall @t18 (= (tptp.multiply @t10 @t1) (tptp.greatest_lower_bound @t17 @t16))))
% 0.18/0.36  (assume @p16 (not (= @t20 @t19)))
% 0.18/0.36  (step @p17 :rule symm :premises (@p16))
% 0.18/0.36  (step @p18 :rule eq-symm :args (@t22 @t20))
% 0.18/0.36  (step @p19 :rule refl :args (@t11))
% 0.18/0.36  (step @p20 :rule cong :premises (@p19 @p18) :args ((=> @t11 @t23)))
% 0.18/0.36  (assume-push @p45 @t11)
% 0.18/0.36  (step @p22 :rule instantiate :premises (@p6) :args (@t24))
% 0.18/0.36  (step-pop @p46 :rule scope :premises (@p22))
% 0.18/0.36  (step @p23 :rule process_scope :premises (@p46) :args (@t23))
% 0.18/0.36  (step @p25 :rule eq_resolve :premises (@p23 @p20))
% 0.18/0.36  (step @p26 :rule implies_elim :premises (@p25))
% 0.18/0.36  (step @p27 :rule chain_m_resolution :premises (@p26 @p6) :args (@t25 (@list false) (@list @t11)))
% 0.18/0.36  (step @p28 :rule eq-symm :args (@t13 @t1))
% 0.18/0.36  (step @p29 :rule cong :premises (@p28) :args (@t14))
% 0.18/0.36  (step @p30 :rule eq_resolve :premises (@p9 @p29))
% 0.18/0.36  (step @p31 :rule instantiate :premises (@p30) :args ((@list tptp.b)))
% 0.18/0.36  (assume-push @p47 @t25)
% 0.18/0.36  (assume-push @p48 @t26)
% 0.18/0.36  (step @p22 :rule instantiate :premises (@p6) :args (@t24))
% 0.18/0.36  (step @p34 :rule refl :args (tptp.a))
% 0.18/0.36  (step @p35 :rule cong :premises (@p34 @p31) :args (@t19))
% 0.18/0.36  (step @p36 :rule trans :premises (@p35 @p22))
% 0.18/0.36  (step-pop @p49 :rule scope :premises (@p36))
% 0.18/0.36  (step-pop @p50 :rule scope :premises (@p49))
% 0.18/0.36  (step @p37 :rule process_scope :premises (@p50) :args (@t27))
% 0.18/0.36  (step @p40 :rule implies_elim :premises (@p37))
% 0.18/0.36  (step @p41 :rule cnf_and_neg :args (@t28))
% 0.18/0.36  (step @p42 :rule resolution :premises (@p41 @p40) :args (true @t28))
% 0.18/0.36  (step @p43 :rule reordering :premises (@p42) :args ((or @t27 (not @t25) (not @t26))))
% 0.18/0.36  (step @p44 false :rule chain_m_resolution :premises (@p43 @p31 @p27 @p17) :args (false (@list false false true) (@list @t26 @t25 @t27)))
% 0.18/0.36  )
% 0.18/0.36  % SZS output end Proof
% 0.18/0.36  % cvc5 exiting
%------------------------------------------------------------------------------