↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : MGT071+1 : TPTP v9.3.0. Released v9.3.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   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:04:56 AM UTC 2026

% Result   : Theorem 0.20s 0.52s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT071+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.05  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n010.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep  7 13:55:26 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.45  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.20/0.52  % SZS status Theorem
% 0.20/0.52  % SZS output start Proof
% 0.20/0.52  (
% 0.20/0.52  (declare-sort $$unsorted 0)
% 0.20/0.52  (declare-const tptp.n0 $$unsorted)
% 0.20/0.52  (declare-const tptp.box2_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.n15 $$unsorted)
% 0.20/0.52  (declare-const tptp.box2_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.in_box3 (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.n10 $$unsorted)
% 0.20/0.52  (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$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.n5 $$unsorted)
% 0.20/0.52  (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.in_box2 (-> $$unsorted $$unsorted $$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.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 () (@var "Z" $$unsorted))
% 0.20/0.52  (define @t4 () (tptp.less @t1 @t3))
% 0.20/0.52  (define @t5 () (@var "Y" $$unsorted))
% 0.20/0.52  (define @t6 () (tptp.less @t5 @t3))
% 0.20/0.52  (define @t7 () (tptp.less @t1 @t5))
% 0.20/0.52  (define @t8 () (@list @t1 @t5 @t3))
% 0.20/0.52  (define @t9 () (= @t1 @t5))
% 0.20/0.52  (define @t10 () (@list @t1 @t5))
% 0.20/0.52  (define @t11 () (tptp.leq @t1 @t5))
% 0.20/0.52  (define @t12 () (tptp.leq @t5 @t3))
% 0.20/0.52  (define @t13 () (@var "B" $$unsorted))
% 0.20/0.52  (define @t14 () (tptp.leq @t1 @t13))
% 0.20/0.52  (define @t15 () (@var "A" $$unsorted))
% 0.20/0.52  (define @t16 () (tptp.leq @t15 @t1))
% 0.20/0.52  (define @t17 () (@list @t1 @t15 @t13))
% 0.20/0.52  (define @t18 () (tptp.less @t15 @t1))
% 0.20/0.52  (define @t19 () (tptp.less @t1 @t13))
% 0.20/0.52  (define @t20 () (@var "I2hi" $$unsorted))
% 0.20/0.52  (define @t21 () (@var "I2lo" $$unsorted))
% 0.20/0.52  (define @t22 () (tptp.in_closed @t1 @t21 @t20))
% 0.20/0.52  (define @t23 () (@var "I1hi" $$unsorted))
% 0.20/0.52  (define @t24 () (@var "I1lo" $$unsorted))
% 0.20/0.52  (define @t25 () (tptp.in_closed @t1 @t24 @t23))
% 0.20/0.52  (define @t26 () (and @t25 @t22))
% 0.20/0.52  (define @t27 () (exists @t2 @t26))
% 0.20/0.52  (define @t28 () (not @t27))
% 0.20/0.52  (define @t29 () (tptp.axis_conflict @t24 @t23 @t21 @t20))
% 0.20/0.52  (define @t30 () (= @t29 @t28))
% 0.20/0.52  (define @t31 () (@list @t24 @t23 @t21 @t20))
% 0.20/0.52  (define @t32 () (forall @t31 @t30))
% 0.20/0.52  (define @t33 () (@var "V" $$unsorted))
% 0.20/0.52  (define @t34 () (@var "V2" $$unsorted))
% 0.20/0.52  (define @t35 () (@var "V1" $$unsorted))
% 0.20/0.52  (define @t36 () (tptp.box_verdict @t35 @t34))
% 0.20/0.52  (define @t37 () (= @t36 tptp.conflict))
% 0.20/0.52  (define @t38 () (= @t34 tptp.conflict))
% 0.20/0.52  (define @t39 () (= @t35 tptp.conflict))
% 0.20/0.52  (define @t40 () (tptp.is_verdict @t34))
% 0.20/0.52  (define @t41 () (tptp.is_verdict @t35))
% 0.20/0.52  (define @t42 () (@list @t35 @t34))
% 0.20/0.52  (define @t43 () (= @t36 tptp.compatible))
% 0.20/0.52  (define @t44 () (= @t36 tptp.unknown))
% 0.20/0.52  (define @t45 () (@var "B2" $$unsorted))
% 0.20/0.52  (define @t46 () (@var "A2" $$unsorted))
% 0.20/0.52  (define @t47 () (@var "X2" $$unsorted))
% 0.20/0.52  (define @t48 () (tptp.in_closed @t47 @t46 @t45))
% 0.20/0.52  (define @t49 () (@var "B1" $$unsorted))
% 0.20/0.52  (define @t50 () (@var "A1" $$unsorted))
% 0.20/0.52  (define @t51 () (@var "X1" $$unsorted))
% 0.20/0.52  (define @t52 () (tptp.in_closed @t51 @t50 @t49))
% 0.20/0.52  (define @t53 () (@var "B3" $$unsorted))
% 0.20/0.52  (define @t54 () (@var "A3" $$unsorted))
% 0.20/0.52  (define @t55 () (@var "X3" $$unsorted))
% 0.20/0.52  (define @t56 () (@var "D2" $$unsorted))
% 0.20/0.52  (define @t57 () (@var "C2" $$unsorted))
% 0.20/0.52  (define @t58 () (@var "D1" $$unsorted))
% 0.20/0.52  (define @t59 () (@var "C1" $$unsorted))
% 0.20/0.52  (define @t60 () (@list @t50 @t49 @t46 @t45 @t59 @t58 @t57 @t56))
% 0.20/0.52  (define @t61 () (tptp.axis_conflict tptp.n0 tptp.n5 tptp.n10 tptp.n15))
% 0.20/0.52  (define @t62 () (tptp.in_closed @t1 tptp.n10 tptp.n15))
% 0.20/0.52  (define @t63 () (tptp.in_closed @t1 tptp.n0 tptp.n5))
% 0.20/0.52  (define @t64 () (and @t63 @t62))
% 0.20/0.52  (define @t65 () (exists @t2 @t64))
% 0.20/0.52  (define @t66 () (forall @t2 (or (not @t25) (not @t22))))
% 0.20/0.52  (define @t67 () (forall @t2 (not @t26)))
% 0.20/0.52  (define @t68 () (not @t67))
% 0.20/0.52  (define @t69 () (forall @t2 (not @t64)))
% 0.20/0.52  (define @t70 () (not @t69))
% 0.20/0.52  (define @t71 () (forall @t2 (or (not @t63) (not @t62))))
% 0.20/0.52  (define @t72 () (= @t61 @t71))
% 0.20/0.52  (define @t73 () (not @t72))
% 0.20/0.52  (define @t74 () (@list true false))
% 0.20/0.52  (define @t75 () (forall @t31 (= @t29 @t66)))
% 0.20/0.52  (assume @p1 (forall @t2 (not (tptp.less @t1 @t1))))
% 0.20/0.52  (assume @p2 (forall @t8 (=> (and @t7 @t6) @t4)))
% 0.20/0.52  (assume @p3 (forall @t10 (or @t7 @t9 (tptp.less @t5 @t1))))
% 0.20/0.52  (assume @p4 (forall @t10 (= @t11 (or @t7 @t9))))
% 0.20/0.52  (assume @p5 (forall @t10 (=> (and @t11 (tptp.leq @t5 @t1)) @t9)))
% 0.20/0.52  (assume @p6 (forall @t10 (=> @t7 @t11)))
% 0.20/0.52  (assume @p7 (forall @t8 (=> (and @t11 @t6) @t4)))
% 0.20/0.53  (assume @p8 (forall @t8 (=> (and @t7 @t12) @t4)))
% 0.20/0.53  (assume @p9 (forall @t8 (=> (and @t11 @t12) (tptp.leq @t1 @t3))))
% 0.20/0.53  (assume @p10 (forall @t17 (= (tptp.in_closed @t1 @t15 @t13) (and @t16 @t14))))
% 0.20/0.53  (assume @p11 (forall @t17 (= (tptp.in_lopen @t1 @t15 @t13) (and @t18 @t14))))
% 0.20/0.53  (assume @p12 (forall @t17 (= (tptp.in_ropen @t1 @t15 @t13) (and @t16 @t19))))
% 0.20/0.53  (assume @p13 (forall @t17 (= (tptp.in_open @t1 @t15 @t13) (and @t18 @t19))))
% 0.20/0.53  (assume @p14 @t32)
% 0.20/0.53  (assume @p15 (forall @t31 (= (tptp.axis_compatible @t24 @t23 @t21 @t20) @t27)))
% 0.20/0.53  (assume @p16 (forall @t31 (= (tptp.axis_subsumes @t24 @t23 @t21 @t20) (forall @t2 (=> @t25 @t22)))))
% 0.20/0.53  (assume @p17 (tptp.is_verdict tptp.conflict))
% 0.20/0.53  (assume @p18 (tptp.is_verdict tptp.compatible))
% 0.20/0.53  (assume @p19 (tptp.is_verdict tptp.unknown))
% 0.20/0.53  (assume @p20 (not (= tptp.conflict tptp.compatible)))
% 0.20/0.53  (assume @p21 (not (= tptp.conflict tptp.unknown)))
% 0.20/0.53  (assume @p22 (not (= tptp.compatible tptp.unknown)))
% 0.20/0.53  (assume @p23 (forall (@list @t33) (=> (tptp.is_verdict @t33) (or (= @t33 tptp.conflict) (= @t33 tptp.compatible) (= @t33 tptp.unknown)))))
% 0.20/0.53  (assume @p24 (forall @t42 (=> (and @t41 @t40 (or @t39 @t38)) @t37)))
% 0.20/0.53  (assume @p25 (forall @t42 (=> (and @t41 @t40 (= @t35 tptp.compatible) (= @t34 tptp.compatible)) @t43)))
% 0.20/0.53  (assume @p26 (forall @t42 (=> (and @t41 @t40 (or (= @t35 tptp.unknown) (= @t34 tptp.unknown)) (not @t39) (not @t38)) @t44)))
% 0.20/0.53  (assume @p27 (forall @t42 (=> (and @t41 @t40) (or @t37 @t43 @t44))))
% 0.20/0.53  (assume @p28 (forall (@list @t51 @t47 @t50 @t49 @t46 @t45) (= (tptp.in_box2 @t51 @t47 @t50 @t49 @t46 @t45) (and @t52 @t48))))
% 0.20/0.53  (assume @p29 (forall (@list @t51 @t47 @t55 @t50 @t49 @t46 @t45 @t54 @t53) (= (tptp.in_box3 @t51 @t47 @t55 @t50 @t49 @t46 @t45 @t54 @t53) (and @t52 @t48 (tptp.in_closed @t55 @t54 @t53)))))
% 0.20/0.53  (assume @p30 (forall @t60 (= (tptp.box2_compatible @t50 @t49 @t46 @t45 @t59 @t58 @t57 @t56) (and (tptp.axis_compatible @t50 @t49 @t59 @t58) (tptp.axis_compatible @t46 @t45 @t57 @t56)))))
% 0.20/0.53  (assume @p31 (forall @t60 (= (tptp.box2_conflict @t50 @t49 @t46 @t45 @t59 @t58 @t57 @t56) (or (tptp.axis_conflict @t50 @t49 @t59 @t58) (tptp.axis_conflict @t46 @t45 @t57 @t56)))))
% 0.20/0.53  (assume @p32 (forall (@list @t1 @t33) (= (tptp.in_closed @t1 @t33 @t33) (= @t1 @t33))))
% 0.20/0.53  (assume @p33 (tptp.less tptp.n0 tptp.n5))
% 0.20/0.53  (assume @p34 (tptp.less tptp.n5 tptp.n10))
% 0.20/0.53  (assume @p35 (tptp.less tptp.n10 tptp.n15))
% 0.20/0.53  (assume @p36 @t61)
% 0.20/0.53  (assume @p37 (not (not @t65)))
% 0.20/0.53  (assume @p38 true)
% 0.20/0.53  (step @p39 :rule bool-double-not-elim :args (@t66))
% 0.20/0.53  (step @p40 :rule bool-and-de-morgan :args (@t25 @t22 true))
% 0.20/0.53  (step @p41 :rule cong :premises (@p40) :args (@t67))
% 0.20/0.53  (step @p42 :rule cong :premises (@p41) :args (@t68))
% 0.20/0.53  (step @p43 :rule exists-elim :args ((= @t27 @t68)))
% 0.20/0.53  (step @p44 :rule trans :premises (@p43 @p42))
% 0.20/0.53  (step @p45 :rule cong :premises (@p44) :args (@t28))
% 0.20/0.53  (step @p46 :rule trans :premises (@p45 @p39))
% 0.20/0.53  (step @p47 :rule refl :args (@t29))
% 0.20/0.53  (step @p48 :rule cong :premises (@p47 @p46) :args (@t30))
% 0.20/0.53  (step @p49 :rule cong :premises (@p48) :args (@t32))
% 0.20/0.53  (step @p50 :rule eq_resolve :premises (@p14 @p49))
% 0.20/0.53  (step @p51 :rule bool-and-de-morgan :args (@t63 @t62 true))
% 0.20/0.53  (step @p52 :rule cong :premises (@p51) :args (@t69))
% 0.20/0.53  (step @p53 :rule cong :premises (@p52) :args (@t70))
% 0.20/0.53  (step @p54 :rule exists-elim :args ((= @t65 @t70)))
% 0.20/0.53  (step @p55 :rule trans :premises (@p54 @p53))
% 0.20/0.53  (step @p56 :rule bool-double-not-elim :args (@t65))
% 0.20/0.53  (step @p57 :rule trans :premises (@p56 @p55))
% 0.20/0.53  (step @p58 :rule eq_resolve :premises (@p37 @p57))
% 0.20/0.53  (step @p59 :rule cnf_equiv_pos1 :args (@t72))
% 0.20/0.53  (step @p60 :rule reordering :premises (@p59) :args ((or @t71 (not @t61) @t73)))
% 0.20/0.53  (step @p61 :rule chain_m_resolution :premises (@p60 @p58 @p36) :args (@t73 @t74 (@list @t71 @t61)))
% 0.20/0.53  (assume-push @p68 @t75)
% 0.20/0.53  (step @p63 :rule instantiate :premises (@p50) :args ((@list tptp.n0 tptp.n5 tptp.n10 tptp.n15)))
% 0.20/0.53  (step-pop @p69 :rule scope :premises (@p63))
% 0.20/0.53  (step @p64 :rule process_scope :premises (@p69) :args (@t72))
% 0.20/0.53  (step @p66 :rule implies_elim :premises (@p64))
% 0.20/0.53  (step @p67 false :rule chain_m_resolution :premises (@p66 @p61 @p50) :args (false @t74 (@list @t72 @t75)))
% 0.20/0.53  )
% 0.20/0.53  % SZS output end Proof
% 0.20/0.53  % cvc5 exiting
%------------------------------------------------------------------------------