↑ Up

cvc5---1.3.4.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : MGT104+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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:59 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT104+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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 14:38:11 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.44  %----Proving TF0_NAR, FOF, or CNF
% 0.13/0.46  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.20/0.51  % SZS status Unsatisfiable
% 0.20/0.51  % SZS output start Proof
% 0.20/0.52  (
% 0.20/0.52  (declare-sort $$unsorted 0)
% 0.20/0.52  (declare-const tptp.v1200 $$unsorted)
% 0.20/0.52  (declare-const tptp.sem_nonempty (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.gt $$unsorted)
% 0.20/0.52  (declare-const tptp.lt $$unsorted)
% 0.20/0.52  (declare-const tptp.gteq $$unsorted)
% 0.20/0.52  (declare-const tptp.lteq $$unsorted)
% 0.20/0.52  (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted))
% 0.20/0.52  (declare-const tptp.v0 $$unsorted)
% 0.20/0.52  (declare-const tptp.less (-> $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.leq (-> $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.is_op (-> $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.wf (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.conflict $$unsorted)
% 0.20/0.52  (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.val (-> $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.eq $$unsorted)
% 0.20/0.52  (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.is_verdict (-> $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.compatible $$unsorted)
% 0.20/0.52  (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.unknown $$unsorted)
% 0.20/0.52  (define @t1 () (@var "X" $$unsorted))
% 0.20/0.52  (define @t2 () (@list @t1))
% 0.20/0.52  (define @t3 () (forall @t2 (not (tptp.less @t1 @t1))))
% 0.20/0.52  (define @t4 () (@var "Z" $$unsorted))
% 0.20/0.52  (define @t5 () (tptp.less @t1 @t4))
% 0.20/0.52  (define @t6 () (@var "Y" $$unsorted))
% 0.20/0.52  (define @t7 () (tptp.less @t6 @t4))
% 0.20/0.52  (define @t8 () (tptp.less @t1 @t6))
% 0.20/0.52  (define @t9 () (@list @t1 @t6 @t4))
% 0.20/0.52  (define @t10 () (= @t1 @t6))
% 0.20/0.52  (define @t11 () (@list @t1 @t6))
% 0.20/0.52  (define @t12 () (tptp.leq @t1 @t6))
% 0.20/0.52  (define @t13 () (tptp.leq @t6 @t4))
% 0.20/0.52  (define @t14 () (@var "B" $$unsorted))
% 0.20/0.52  (define @t15 () (tptp.leq @t1 @t14))
% 0.20/0.52  (define @t16 () (@var "A" $$unsorted))
% 0.20/0.52  (define @t17 () (tptp.leq @t16 @t1))
% 0.20/0.52  (define @t18 () (@list @t1 @t16 @t14))
% 0.20/0.52  (define @t19 () (tptp.less @t16 @t1))
% 0.20/0.52  (define @t20 () (tptp.less @t1 @t14))
% 0.20/0.52  (define @t21 () (@var "I2hi" $$unsorted))
% 0.20/0.52  (define @t22 () (@var "I2lo" $$unsorted))
% 0.20/0.52  (define @t23 () (tptp.in_closed @t1 @t22 @t21))
% 0.20/0.52  (define @t24 () (@var "I1hi" $$unsorted))
% 0.20/0.52  (define @t25 () (@var "I1lo" $$unsorted))
% 0.20/0.52  (define @t26 () (tptp.in_closed @t1 @t25 @t24))
% 0.20/0.52  (define @t27 () (exists @t2 (and @t26 @t23)))
% 0.20/0.52  (define @t28 () (@list @t25 @t24 @t22 @t21))
% 0.20/0.52  (define @t29 () (@var "V" $$unsorted))
% 0.20/0.52  (define @t30 () (@var "V2" $$unsorted))
% 0.20/0.52  (define @t31 () (@var "V1" $$unsorted))
% 0.20/0.52  (define @t32 () (tptp.box_verdict @t31 @t30))
% 0.20/0.52  (define @t33 () (= @t32 tptp.conflict))
% 0.20/0.52  (define @t34 () (= @t30 tptp.conflict))
% 0.20/0.52  (define @t35 () (= @t31 tptp.conflict))
% 0.20/0.52  (define @t36 () (tptp.is_verdict @t30))
% 0.20/0.52  (define @t37 () (tptp.is_verdict @t31))
% 0.20/0.52  (define @t38 () (@list @t31 @t30))
% 0.20/0.52  (define @t39 () (= @t32 tptp.compatible))
% 0.20/0.52  (define @t40 () (= @t32 tptp.unknown))
% 0.20/0.52  (define @t41 () (@var "SupD" $$unsorted))
% 0.20/0.52  (define @t42 () (tptp.leq @t29 @t41))
% 0.20/0.52  (define @t43 () (@var "InfD" $$unsorted))
% 0.20/0.52  (define @t44 () (tptp.leq @t43 @t29))
% 0.20/0.52  (define @t45 () (and @t44 @t42))
% 0.20/0.52  (define @t46 () (tptp.wf tptp.eq @t29 @t43 @t41))
% 0.20/0.52  (define @t47 () (@list @t29 @t43 @t41))
% 0.20/0.52  (define @t48 () (tptp.wf tptp.lteq @t29 @t43 @t41))
% 0.20/0.52  (define @t49 () (tptp.wf tptp.gteq @t29 @t43 @t41))
% 0.20/0.52  (define @t50 () (tptp.wf tptp.lt @t29 @t43 @t41))
% 0.20/0.52  (define @t51 () (tptp.wf tptp.gt @t29 @t43 @t41))
% 0.20/0.52  (define @t52 () (@var "Op" $$unsorted))
% 0.20/0.52  (define @t53 () (tptp.less tptp.v0 tptp.v0))
% 0.20/0.52  (assume @p1 @t3)
% 0.20/0.52  (assume @p2 (forall @t9 (=> (and @t8 @t7) @t5)))
% 0.20/0.52  (assume @p3 (forall @t11 (or @t8 @t10 (tptp.less @t6 @t1))))
% 0.20/0.52  (assume @p4 (forall @t11 (= @t12 (or @t8 @t10))))
% 0.20/0.52  (assume @p5 (forall @t11 (=> (and @t12 (tptp.leq @t6 @t1)) @t10)))
% 0.20/0.52  (assume @p6 (forall @t11 (=> @t8 @t12)))
% 0.20/0.52  (assume @p7 (forall @t9 (=> (and @t12 @t7) @t5)))
% 0.20/0.52  (assume @p8 (forall @t9 (=> (and @t8 @t13) @t5)))
% 0.20/0.52  (assume @p9 (forall @t9 (=> (and @t12 @t13) (tptp.leq @t1 @t4))))
% 0.20/0.52  (assume @p10 (forall @t18 (= (tptp.in_closed @t1 @t16 @t14) (and @t17 @t15))))
% 0.20/0.52  (assume @p11 (forall @t18 (= (tptp.in_lopen @t1 @t16 @t14) (and @t19 @t15))))
% 0.20/0.52  (assume @p12 (forall @t18 (= (tptp.in_ropen @t1 @t16 @t14) (and @t17 @t20))))
% 0.20/0.52  (assume @p13 (forall @t18 (= (tptp.in_open @t1 @t16 @t14) (and @t19 @t20))))
% 0.20/0.52  (assume @p14 (forall @t28 (= (tptp.axis_conflict @t25 @t24 @t22 @t21) (not @t27))))
% 0.20/0.52  (assume @p15 (forall @t28 (= (tptp.axis_compatible @t25 @t24 @t22 @t21) @t27)))
% 0.20/0.52  (assume @p16 (forall @t28 (= (tptp.axis_subsumes @t25 @t24 @t22 @t21) (forall @t2 (=> @t26 @t23)))))
% 0.20/0.52  (assume @p17 (tptp.is_verdict tptp.conflict))
% 0.20/0.52  (assume @p18 (tptp.is_verdict tptp.compatible))
% 0.20/0.52  (assume @p19 (tptp.is_verdict tptp.unknown))
% 0.20/0.52  (assume @p20 (not (= tptp.conflict tptp.compatible)))
% 0.20/0.52  (assume @p21 (not (= tptp.conflict tptp.unknown)))
% 0.20/0.52  (assume @p22 (not (= tptp.compatible tptp.unknown)))
% 0.20/0.52  (assume @p23 (forall (@list @t29) (=> (tptp.is_verdict @t29) (or (= @t29 tptp.conflict) (= @t29 tptp.compatible) (= @t29 tptp.unknown)))))
% 0.20/0.52  (assume @p24 (forall @t38 (=> (and @t37 @t36 (or @t35 @t34)) @t33)))
% 0.20/0.52  (assume @p25 (forall @t38 (=> (and @t37 @t36 (= @t31 tptp.compatible) (= @t30 tptp.compatible)) @t39)))
% 0.20/0.52  (assume @p26 (forall @t38 (=> (and @t37 @t36 (or (= @t31 tptp.unknown) (= @t30 tptp.unknown)) (not @t35) (not @t34)) @t40)))
% 0.20/0.52  (assume @p27 (forall @t38 (=> (and @t37 @t36) (or @t33 @t39 @t40))))
% 0.20/0.52  (assume @p28 (forall @t47 (= @t46 @t45)))
% 0.20/0.52  (assume @p29 (forall @t47 (= @t48 @t45)))
% 0.20/0.52  (assume @p30 (forall @t47 (= @t49 @t45)))
% 0.20/0.52  (assume @p31 (forall @t47 (= @t50 (and @t44 @t42 (not (= @t29 @t43))))))
% 0.20/0.52  (assume @p32 (forall @t47 (= @t51 (and @t44 @t42 (not (= @t29 @t41))))))
% 0.20/0.52  (assume @p33 (forall @t47 (=> @t46 (tptp.sem_nonempty tptp.eq @t29 @t43 @t41))))
% 0.20/0.52  (assume @p34 (forall @t47 (=> @t48 (tptp.sem_nonempty tptp.lteq @t29 @t43 @t41))))
% 0.20/0.52  (assume @p35 (forall @t47 (=> @t49 (tptp.sem_nonempty tptp.gteq @t29 @t43 @t41))))
% 0.20/0.52  (assume @p36 (forall @t47 (=> @t50 (tptp.sem_nonempty tptp.lt @t29 @t43 @t41))))
% 0.20/0.52  (assume @p37 (forall @t47 (=> @t51 (tptp.sem_nonempty tptp.gt @t29 @t43 @t41))))
% 0.20/0.52  (assume @p38 (tptp.is_op tptp.eq))
% 0.20/0.52  (assume @p39 (tptp.is_op tptp.lt))
% 0.20/0.52  (assume @p40 (tptp.is_op tptp.lteq))
% 0.20/0.52  (assume @p41 (tptp.is_op tptp.gt))
% 0.20/0.52  (assume @p42 (tptp.is_op tptp.gteq))
% 0.20/0.52  (assume @p43 (not (= tptp.eq tptp.lt)))
% 0.20/0.52  (assume @p44 (not (= tptp.eq tptp.lteq)))
% 0.20/0.52  (assume @p45 (not (= tptp.eq tptp.gt)))
% 0.20/0.52  (assume @p46 (not (= tptp.eq tptp.gteq)))
% 0.20/0.52  (assume @p47 (not (= tptp.lt tptp.lteq)))
% 0.20/0.52  (assume @p48 (not (= tptp.lt tptp.gt)))
% 0.20/0.52  (assume @p49 (not (= tptp.lt tptp.gteq)))
% 0.20/0.52  (assume @p50 (not (= tptp.lteq tptp.gt)))
% 0.20/0.52  (assume @p51 (not (= tptp.lteq tptp.gteq)))
% 0.20/0.52  (assume @p52 (not (= tptp.gt tptp.gteq)))
% 0.20/0.52  (assume @p53 (forall (@list @t52) (=> (tptp.is_op @t52) (or (= @t52 tptp.eq) (= @t52 tptp.lt) (= @t52 tptp.lteq) (= @t52 tptp.gt) (= @t52 tptp.gteq)))))
% 0.20/0.52  (assume @p54 (tptp.val tptp.v0))
% 0.20/0.52  (assume @p55 (tptp.val tptp.v1200))
% 0.20/0.52  (assume @p56 (tptp.less tptp.v0 tptp.v1200))
% 0.20/0.52  (assume @p57 (not (= tptp.v0 tptp.v1200)))
% 0.20/0.52  (assume @p58 @t53)
% 0.20/0.52  (assume-push @p65 @t3)
% 0.20/0.52  (step @p60 :rule instantiate :premises (@p1) :args ((@list tptp.v0)))
% 0.20/0.52  (step-pop @p66 :rule scope :premises (@p60))
% 0.20/0.52  (step @p61 :rule process_scope :premises (@p66) :args ((not @t53)))
% 0.20/0.52  (step @p63 :rule implies_elim :premises (@p61))
% 0.20/0.52  (step @p64 false :rule chain_m_resolution :premises (@p63 @p58 @p1) :args (false (@list false false) (@list @t53 @t3)))
% 0.20/0.52  )
% 0.20/0.52  % SZS output end Proof
% 0.20/0.52  % cvc5 exiting
%------------------------------------------------------------------------------