↑ Up

cvc5---1.3.4.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : MGT032-2 : TPTP v9.3.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:04:47 AM UTC 2026

% Result   : Unsatisfiable 0.20s 0.50s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT032-2 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.05  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n007.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep  7 12:21:26 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.44  %----Proving TF0_NAR, FOF, or CNF
% 0.10/0.45  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.20/0.50  % SZS status Unsatisfiable
% 0.20/0.50  % SZS output start Proof
% 0.20/0.50  (
% 0.20/0.50  (declare-sort $$unsorted 0)
% 0.20/0.50  (declare-const tptp.sk2 $$unsorted)
% 0.20/0.50  (declare-const tptp.first_movers $$unsorted)
% 0.20/0.50  (declare-const tptp.greater_or_equal (-> $$unsorted $$unsorted Bool))
% 0.20/0.50  (declare-const tptp.stable (-> $$unsorted Bool))
% 0.20/0.50  (declare-const tptp.in_environment (-> $$unsorted $$unsorted Bool))
% 0.20/0.50  (declare-const tptp.sk1 (-> $$unsorted $$unsorted))
% 0.20/0.50  (declare-const tptp.environment (-> $$unsorted Bool))
% 0.20/0.50  (declare-const tptp.subpopulations (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.50  (declare-const tptp.efficient_producers $$unsorted)
% 0.20/0.50  (declare-const tptp.greater (-> $$unsorted $$unsorted Bool))
% 0.20/0.50  (declare-const tptp.growth_rate (-> $$unsorted $$unsorted $$unsorted))
% 0.20/0.50  (declare-const tptp.sk3 (-> $$unsorted $$unsorted))
% 0.20/0.50  (declare-const tptp.selection_favors (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.50  (define @t1 () (@var "D" $$unsorted))
% 0.20/0.50  (define @t2 () (@var "B" $$unsorted))
% 0.20/0.50  (define @t3 () (@var "C" $$unsorted))
% 0.20/0.50  (define @t4 () (@var "A" $$unsorted))
% 0.20/0.50  (define @t5 () (not (tptp.environment @t4)))
% 0.20/0.50  (define @t6 () (tptp.sk1 @t4))
% 0.20/0.50  (define @t7 () (not (tptp.stable @t4)))
% 0.20/0.50  (define @t8 () (@list @t4))
% 0.20/0.50  (define @t9 () (tptp.environment tptp.sk2))
% 0.20/0.50  (define @t10 () (tptp.stable tptp.sk2))
% 0.20/0.50  (define @t11 () (tptp.sk3 @t4))
% 0.20/0.50  (define @t12 () (not (tptp.in_environment tptp.sk2 @t4)))
% 0.20/0.50  (define @t13 () (tptp.sk1 tptp.sk2))
% 0.20/0.50  (define @t14 () (@list @t13))
% 0.20/0.50  (define @t15 () (tptp.in_environment tptp.sk2 @t13))
% 0.20/0.50  (define @t16 () (not @t10))
% 0.20/0.50  (define @t17 () (not @t9))
% 0.20/0.50  (define @t18 () (or @t17 @t16 @t15))
% 0.20/0.50  (define @t19 () (tptp.sk3 @t13))
% 0.20/0.50  (define @t20 () (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 @t19))
% 0.20/0.50  (define @t21 () (not @t15))
% 0.20/0.50  (define @t22 () (or @t21 @t20))
% 0.20/0.50  (define @t23 () (@list false false))
% 0.20/0.50  (define @t24 () (tptp.greater_or_equal @t19 @t13))
% 0.20/0.50  (define @t25 () (or @t21 @t24))
% 0.20/0.50  (define @t26 () (tptp.selection_favors tptp.efficient_producers tptp.first_movers @t19))
% 0.20/0.50  (define @t27 () (not @t26))
% 0.20/0.50  (define @t28 () (or @t21 @t27))
% 0.20/0.50  (define @t29 () (tptp.greater (tptp.growth_rate tptp.efficient_producers @t19) (tptp.growth_rate tptp.first_movers @t19)))
% 0.20/0.50  (define @t30 () (not @t29))
% 0.20/0.50  (define @t31 () (not @t20))
% 0.20/0.50  (define @t32 () (or @t17 @t31 @t30 @t26))
% 0.20/0.50  (define @t33 () (not @t24))
% 0.20/0.50  (define @t34 () (or @t17 @t16 @t31 @t33 @t29))
% 0.20/0.50  (assume @p1 (forall (@list @t4 @t2 @t3 @t1) (or @t5 (not (tptp.subpopulations @t2 @t3 @t4 @t1)) (not (tptp.greater (tptp.growth_rate @t3 @t1) (tptp.growth_rate @t2 @t1))) (tptp.selection_favors @t3 @t2 @t1))))
% 0.20/0.50  (assume @p2 (forall @t8 (or @t5 @t7 (tptp.in_environment @t4 @t6))))
% 0.20/0.50  (assume @p3 (forall (@list @t4 @t2) (or @t5 @t7 (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers @t4 @t2)) (not (tptp.greater_or_equal @t2 @t6)) (tptp.greater (tptp.growth_rate tptp.efficient_producers @t2) (tptp.growth_rate tptp.first_movers @t2)))))
% 0.20/0.50  (assume @p4 @t9)
% 0.20/0.50  (assume @p5 @t10)
% 0.20/0.50  (assume @p6 (forall @t8 (or @t12 (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk2 @t11))))
% 0.20/0.50  (assume @p7 (forall @t8 (or @t12 (tptp.greater_or_equal @t11 @t4))))
% 0.20/0.50  (assume @p8 (forall @t8 (or @t12 (not (tptp.selection_favors tptp.efficient_producers tptp.first_movers @t11)))))
% 0.20/0.50  (step @p9 :rule instantiate :premises (@p6) :args (@t14))
% 0.20/0.50  (step @p10 :rule instantiate :premises (@p2) :args ((@list tptp.sk2)))
% 0.20/0.50  (step @p11 :rule cnf_or_pos :args (@t18))
% 0.20/0.50  (step @p12 :rule reordering :premises (@p11) :args ((or @t17 @t16 @t15 (not @t18))))
% 0.20/0.50  (step @p13 :rule chain_m_resolution :premises (@p12 @p4 @p5 @p10) :args (@t15 (@list false false false) (@list @t9 @t10 @t18)))
% 0.20/0.50  (step @p14 :rule cnf_or_pos :args (@t22))
% 0.20/0.50  (step @p15 :rule reordering :premises (@p14) :args ((or @t21 @t20 (not @t22))))
% 0.20/0.50  (step @p16 :rule chain_m_resolution :premises (@p15 @p13 @p9) :args (@t20 @t23 (@list @t15 @t22)))
% 0.20/0.50  (step @p17 :rule instantiate :premises (@p7) :args (@t14))
% 0.20/0.50  (step @p18 :rule cnf_or_pos :args (@t25))
% 0.20/0.50  (step @p19 :rule reordering :premises (@p18) :args ((or @t21 @t24 (not @t25))))
% 0.20/0.50  (step @p20 :rule chain_m_resolution :premises (@p19 @p13 @p17) :args (@t24 @t23 (@list @t15 @t25)))
% 0.20/0.50  (step @p21 :rule instantiate :premises (@p3) :args ((@list tptp.sk2 @t19)))
% 0.20/0.50  (step @p22 :rule instantiate :premises (@p1) :args ((@list tptp.sk2 tptp.first_movers tptp.efficient_producers @t19)))
% 0.20/0.50  (step @p23 :rule instantiate :premises (@p8) :args (@t14))
% 0.20/0.50  (step @p24 :rule cnf_or_pos :args (@t28))
% 0.20/0.50  (step @p25 :rule reordering :premises (@p24) :args ((or @t21 @t27 (not @t28))))
% 0.20/0.50  (step @p26 :rule chain_m_resolution :premises (@p25 @p13 @p23) :args (@t27 @t23 (@list @t15 @t28)))
% 0.20/0.50  (step @p27 :rule cnf_or_pos :args (@t32))
% 0.20/0.50  (step @p28 :rule reordering :premises (@p27) :args ((or @t17 @t26 @t31 @t30 (not @t32))))
% 0.20/0.50  (step @p29 :rule chain_m_resolution :premises (@p28 @p4 @p26 @p16 @p22) :args (@t30 (@list false true false false) (@list @t9 @t26 @t20 @t32)))
% 0.20/0.50  (step @p30 :rule cnf_or_pos :args (@t34))
% 0.20/0.50  (step @p31 :rule reordering :premises (@p30) :args ((or @t17 @t16 @t31 @t33 @t29 (not @t34))))
% 0.20/0.50  (step @p32 false :rule chain_m_resolution :premises (@p31 @p29 @p21 @p20 @p16 @p5 @p4) :args (false (@list true false false false false false) (@list @t29 @t34 @t24 @t20 @t10 @t9)))
% 0.20/0.50  )
% 0.20/0.50  % SZS output end Proof
% 0.20/0.50  % cvc5 exiting
%------------------------------------------------------------------------------