↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n009.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 : Mon Sep  7 11:22:55 AM UTC 2026

% Result   : Theorem 0.21s 0.51s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL451+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.36  % Computer : n009.cluster.edu
% 0.02/0.36  % Model    : x86_64 x86_64
% 0.02/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.36  % Memory   : 8046.5625MB
% 0.02/0.36  % OS       : Linux 6.8.0-71-generic
% 0.02/0.36  % CPULimit : 300
% 0.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Fri Sep  4 20:40:51 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.44  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.21/0.51  % SZS status Theorem
% 0.21/0.51  % SZS output start Proof
% 0.21/0.51  (
% 0.21/0.51  (declare-sort $$unsorted 0)
% 0.21/0.51  (declare-const tptp.op_equiv Bool)
% 0.21/0.51  (declare-const tptp.op_implies_or Bool)
% 0.21/0.51  (declare-const tptp.op_and Bool)
% 0.21/0.51  (declare-const tptp.r4 Bool)
% 0.21/0.51  (declare-const tptp.r3 Bool)
% 0.21/0.51  (declare-const tptp.implies_2 Bool)
% 0.21/0.51  (declare-const tptp.and_2 Bool)
% 0.21/0.51  (declare-const tptp.modus_tollens Bool)
% 0.21/0.51  (declare-const tptp.not (-> $$unsorted $$unsorted))
% 0.21/0.51  (declare-const tptp.op_or Bool)
% 0.21/0.51  (declare-const tptp.or_1 Bool)
% 0.21/0.51  (declare-const tptp.equivalence_3 Bool)
% 0.21/0.51  (declare-const tptp.and_1 Bool)
% 0.21/0.51  (declare-const tptp.equiv (-> $$unsorted $$unsorted $$unsorted))
% 0.21/0.51  (declare-const tptp.implies_3 Bool)
% 0.21/0.51  (declare-const tptp.substitution_of_equivalents Bool)
% 0.21/0.51  (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted))
% 0.21/0.51  (declare-const tptp.and (-> $$unsorted $$unsorted $$unsorted))
% 0.21/0.51  (declare-const tptp.op_implies_and Bool)
% 0.21/0.51  (declare-const tptp.or_3 Bool)
% 0.21/0.51  (declare-const tptp.equivalence_2 Bool)
% 0.21/0.51  (declare-const tptp.modus_ponens Bool)
% 0.21/0.51  (declare-const tptp.implies_1 Bool)
% 0.21/0.51  (declare-const tptp.equivalence_1 Bool)
% 0.21/0.51  (declare-const tptp.op_implies Bool)
% 0.21/0.51  (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted))
% 0.21/0.51  (declare-const tptp.r5 Bool)
% 0.21/0.51  (declare-const tptp.and_3 Bool)
% 0.21/0.51  (declare-const tptp.cn3 Bool)
% 0.21/0.51  (declare-const tptp.or_2 Bool)
% 0.21/0.51  (declare-const tptp.kn1 Bool)
% 0.21/0.51  (declare-const tptp.cn1 Bool)
% 0.21/0.51  (declare-const tptp.kn2 Bool)
% 0.21/0.51  (declare-const tptp.cn2 Bool)
% 0.21/0.51  (declare-const tptp.kn3 Bool)
% 0.21/0.51  (declare-const tptp.is_a_theorem (-> $$unsorted Bool))
% 0.21/0.51  (declare-const tptp.r1 Bool)
% 0.21/0.51  (declare-const tptp.r2 Bool)
% 0.21/0.51  (define @t1 () (@var "Y" $$unsorted))
% 0.21/0.51  (define @t2 () (@var "X" $$unsorted))
% 0.21/0.51  (define @t3 () (tptp.implies @t2 @t1))
% 0.21/0.51  (define @t4 () (@list @t2 @t1))
% 0.21/0.51  (define @t5 () (tptp.equiv @t2 @t1))
% 0.21/0.51  (define @t6 () (tptp.not @t2))
% 0.21/0.51  (define @t7 () (tptp.not @t1))
% 0.21/0.51  (define @t8 () (tptp.implies @t1 @t2))
% 0.21/0.51  (define @t9 () (@var "Z" $$unsorted))
% 0.21/0.51  (define @t10 () (tptp.implies @t2 @t9))
% 0.21/0.51  (define @t11 () (tptp.implies @t1 @t9))
% 0.21/0.51  (define @t12 () (@list @t2 @t1 @t9))
% 0.21/0.51  (define @t13 () (forall @t12 (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies @t11 @t10)))))
% 0.21/0.51  (define @t14 () (tptp.and @t2 @t1))
% 0.21/0.51  (define @t15 () (tptp.or @t2 @t1))
% 0.21/0.51  (define @t16 () (@var "P" $$unsorted))
% 0.21/0.51  (define @t17 () (@list @t16))
% 0.21/0.51  (define @t18 () (@var "Q" $$unsorted))
% 0.21/0.51  (define @t19 () (@list @t16 @t18))
% 0.21/0.51  (define @t20 () (@var "R" $$unsorted))
% 0.21/0.51  (define @t21 () (tptp.implies @t16 @t18))
% 0.21/0.51  (define @t22 () (@list @t16 @t18 @t20))
% 0.21/0.51  (define @t23 () (tptp.implies @t18 @t20))
% 0.21/0.51  (define @t24 () (forall @t22 (tptp.is_a_theorem (tptp.implies @t21 (tptp.implies @t23 (tptp.implies @t16 @t20))))))
% 0.21/0.51  (define @t25 () (tptp.not @t16))
% 0.21/0.51  (define @t26 () (tptp.or @t16 @t18))
% 0.21/0.51  (define @t27 () (tptp.or @t16 @t20))
% 0.21/0.51  (define @t28 () (@list false))
% 0.21/0.51  (assume @p1 (= tptp.modus_ponens (forall @t4 (=> (and (tptp.is_a_theorem @t2) (tptp.is_a_theorem @t3)) (tptp.is_a_theorem @t1)))))
% 0.21/0.51  (assume @p2 (= tptp.substitution_of_equivalents (forall @t4 (=> (tptp.is_a_theorem @t5) (= @t2 @t1)))))
% 0.21/0.51  (assume @p3 (= tptp.modus_tollens (forall @t4 (tptp.is_a_theorem (tptp.implies (tptp.implies @t7 @t6) @t3)))))
% 0.21/0.51  (assume @p4 (= tptp.implies_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 @t8)))))
% 0.21/0.51  (assume @p5 (= tptp.implies_2 (forall @t4 (tptp.is_a_theorem (tptp.implies (tptp.implies @t2 @t3) @t3)))))
% 0.21/0.51  (assume @p6 (= tptp.implies_3 @t13))
% 0.21/0.51  (assume @p7 (= tptp.and_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t14 @t2)))))
% 0.21/0.51  (assume @p8 (= tptp.and_2 (forall @t4 (tptp.is_a_theorem (tptp.implies @t14 @t1)))))
% 0.21/0.51  (assume @p9 (= tptp.and_3 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 (tptp.implies @t1 @t14))))))
% 0.21/0.51  (assume @p10 (= tptp.or_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 @t15)))))
% 0.21/0.51  (assume @p11 (= tptp.or_2 (forall @t4 (tptp.is_a_theorem (tptp.implies @t1 @t15)))))
% 0.21/0.51  (assume @p12 (= tptp.or_3 (forall @t12 (tptp.is_a_theorem (tptp.implies @t10 (tptp.implies @t11 (tptp.implies @t15 @t9)))))))
% 0.21/0.51  (assume @p13 (= tptp.equivalence_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t5 @t3)))))
% 0.21/0.51  (assume @p14 (= tptp.equivalence_2 (forall @t4 (tptp.is_a_theorem (tptp.implies @t5 @t8)))))
% 0.21/0.51  (assume @p15 (= tptp.equivalence_3 (forall @t4 (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies @t8 @t5))))))
% 0.21/0.51  (assume @p16 (= tptp.kn1 (forall @t17 (tptp.is_a_theorem (tptp.implies @t16 (tptp.and @t16 @t16))))))
% 0.21/0.51  (assume @p17 (= tptp.kn2 (forall @t19 (tptp.is_a_theorem (tptp.implies (tptp.and @t16 @t18) @t16)))))
% 0.21/0.51  (assume @p18 (= tptp.kn3 (forall @t22 (tptp.is_a_theorem (tptp.implies @t21 (tptp.implies (tptp.not (tptp.and @t18 @t20)) (tptp.not (tptp.and @t20 @t16))))))))
% 0.21/0.51  (assume @p19 (= tptp.cn1 @t24))
% 0.21/0.51  (assume @p20 (= tptp.cn2 (forall @t19 (tptp.is_a_theorem (tptp.implies @t16 (tptp.implies @t25 @t18))))))
% 0.21/0.51  (assume @p21 (= tptp.cn3 (forall @t17 (tptp.is_a_theorem (tptp.implies (tptp.implies @t25 @t16) @t16)))))
% 0.21/0.51  (assume @p22 (= tptp.r1 (forall @t17 (tptp.is_a_theorem (tptp.implies (tptp.or @t16 @t16) @t16)))))
% 0.21/0.51  (assume @p23 (= tptp.r2 (forall @t19 (tptp.is_a_theorem (tptp.implies @t18 @t26)))))
% 0.21/0.51  (assume @p24 (= tptp.r3 (forall @t19 (tptp.is_a_theorem (tptp.implies @t26 (tptp.or @t18 @t16))))))
% 0.21/0.51  (assume @p25 (= tptp.r4 (forall @t22 (tptp.is_a_theorem (tptp.implies (tptp.or @t16 (tptp.or @t18 @t20)) (tptp.or @t18 @t27))))))
% 0.21/0.51  (assume @p26 (= tptp.r5 (forall @t22 (tptp.is_a_theorem (tptp.implies @t23 (tptp.implies @t26 @t27))))))
% 0.21/0.51  (assume @p27 (=> tptp.op_or (forall @t4 (= @t15 (tptp.not (tptp.and @t6 @t7))))))
% 0.21/0.51  (assume @p28 (=> tptp.op_and (forall @t4 (= @t14 (tptp.not (tptp.or @t6 @t7))))))
% 0.21/0.51  (assume @p29 (=> tptp.op_implies_and (forall @t4 (= @t3 (tptp.not (tptp.and @t2 @t7))))))
% 0.21/0.51  (assume @p30 (=> tptp.op_implies_or (forall @t4 (= @t3 (tptp.or @t6 @t1)))))
% 0.21/0.51  (assume @p31 (=> tptp.op_equiv (forall @t4 (= @t5 (tptp.and @t3 @t8)))))
% 0.21/0.51  (assume @p32 tptp.op_or)
% 0.21/0.51  (assume @p33 tptp.op_implies_and)
% 0.21/0.51  (assume @p34 tptp.op_equiv)
% 0.21/0.51  (assume @p35 tptp.modus_ponens)
% 0.21/0.51  (assume @p36 tptp.modus_tollens)
% 0.21/0.51  (assume @p37 tptp.implies_1)
% 0.21/0.51  (assume @p38 tptp.implies_2)
% 0.21/0.51  (assume @p39 tptp.implies_3)
% 0.21/0.51  (assume @p40 tptp.and_1)
% 0.21/0.51  (assume @p41 tptp.and_2)
% 0.21/0.51  (assume @p42 tptp.and_3)
% 0.21/0.51  (assume @p43 tptp.or_1)
% 0.21/0.51  (assume @p44 tptp.or_2)
% 0.21/0.51  (assume @p45 tptp.or_3)
% 0.21/0.51  (assume @p46 tptp.equivalence_1)
% 0.21/0.51  (assume @p47 tptp.equivalence_2)
% 0.21/0.51  (assume @p48 tptp.equivalence_3)
% 0.21/0.51  (assume @p49 tptp.substitution_of_equivalents)
% 0.21/0.51  (assume @p50 tptp.op_implies)
% 0.21/0.51  (assume @p51 (not tptp.cn1))
% 0.21/0.51  (assume @p52 true)
% 0.21/0.51  (step @p53 :rule equiv_elim1 :premises (@p6))
% 0.21/0.51  (step @p54 :rule reordering :premises (@p53) :args ((or @t13 (not tptp.implies_3))))
% 0.21/0.51  (step @p55 :rule chain_m_resolution :premises (@p54 @p39) :args (@t13 @t28 (@list tptp.implies_3)))
% 0.21/0.51  (step @p56 :rule alpha_equiv :args (@t13 (@list @t2 @t1 @t9) (@list @t16 @t18 @t20)))
% 0.21/0.51  (step @p57 :rule equiv_elim1 :premises (@p56))
% 0.21/0.51  (step @p58 :rule reordering :premises (@p57) :args ((or @t24 (not @t13))))
% 0.21/0.51  (step @p59 :rule chain_m_resolution :premises (@p58 @p55) :args (@t24 @t28 (@list @t13)))
% 0.21/0.51  (step @p60 :rule equiv_elim2 :premises (@p19))
% 0.21/0.51  (step @p61 :rule chain_m_resolution :premises (@p60 @p59) :args (tptp.cn1 @t28 (@list @t24)))
% 0.21/0.51  (step @p62 false :rule chain_m_resolution :premises (@p51 @p61) :args (false @t28 (@list tptp.cn1)))
% 0.21/0.51  )
% 0.21/0.51  % SZS output end Proof
% 0.21/0.51  % cvc5 exiting
%------------------------------------------------------------------------------