↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n019.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:41 AM UTC 2026

% Result   : Unsatisfiable 13.03s 13.40s
% Output   : Proof 13.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL357-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n019.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep  6 00:41:23 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.13/0.43  %----Proving TF0_NAR, FOF, or CNF
% 0.13/0.45  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 13.03/13.40  % SZS status Unsatisfiable
% 13.03/13.40  % SZS output start Proof
% 13.13/13.40  (
% 13.13/13.40  (declare-sort $$unsorted 0)
% 13.13/13.40  (declare-const tptp.x $$unsorted)
% 13.13/13.40  (declare-const tptp.y $$unsorted)
% 13.13/13.40  (declare-const tptp.u $$unsorted)
% 13.13/13.40  (declare-const tptp.z $$unsorted)
% 13.13/13.40  (declare-const tptp.not (-> $$unsorted $$unsorted))
% 13.13/13.40  (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted))
% 13.13/13.40  (declare-const tptp.is_a_theorem (-> $$unsorted Bool))
% 13.13/13.40  (define @t1 () (@var "Y" $$unsorted))
% 13.13/13.40  (define @t2 () (@var "X" $$unsorted))
% 13.13/13.40  (define @t3 () (tptp.implies @t2 @t1))
% 13.13/13.40  (define @t4 () (@list @t2 @t1))
% 13.13/13.40  (define @t5 () (forall @t4 (or (not (tptp.is_a_theorem @t3)) (not (tptp.is_a_theorem @t2)) (tptp.is_a_theorem @t1))))
% 13.13/13.40  (define @t6 () (@var "Z" $$unsorted))
% 13.13/13.40  (define @t7 () (tptp.not @t2))
% 13.13/13.40  (define @t8 () (tptp.implies tptp.y tptp.z))
% 13.13/13.40  (define @t9 () (tptp.implies tptp.x tptp.z))
% 13.13/13.40  (define @t10 () (tptp.implies (tptp.implies @t9 tptp.u) (tptp.implies @t8 tptp.u)))
% 13.13/13.40  (define @t11 () (tptp.implies tptp.x tptp.y))
% 13.13/13.40  (define @t12 () (tptp.implies @t11 @t10))
% 13.13/13.40  (define @t13 () (tptp.is_a_theorem @t12))
% 13.13/13.40  (define @t14 () (tptp.implies @t8 @t9))
% 13.13/13.40  (define @t15 () (tptp.implies @t14 @t10))
% 13.13/13.40  (define @t16 () (tptp.is_a_theorem @t15))
% 13.13/13.40  (define @t17 () (not @t16))
% 13.13/13.40  (define @t18 () (tptp.implies @t15 @t12))
% 13.13/13.40  (define @t19 () (tptp.is_a_theorem @t18))
% 13.13/13.40  (define @t20 () (not @t19))
% 13.13/13.40  (define @t21 () (or @t20 @t17 @t13))
% 13.13/13.40  (define @t22 () (tptp.implies @t11 @t14))
% 13.13/13.40  (define @t23 () (tptp.is_a_theorem @t22))
% 13.13/13.40  (define @t24 () (not @t23))
% 13.13/13.40  (define @t25 () (tptp.is_a_theorem (tptp.implies @t22 @t18)))
% 13.13/13.40  (define @t26 () (not @t25))
% 13.13/13.40  (define @t27 () (or @t26 @t24 @t19))
% 13.13/13.40  (define @t28 () (not @t27))
% 13.13/13.40  (assume @p1 @t5)
% 13.13/13.40  (assume @p2 (forall (@list @t2 @t1 @t6) (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies (tptp.implies @t1 @t6) (tptp.implies @t2 @t6))))))
% 13.13/13.40  (assume @p3 (forall (@list @t2) (tptp.is_a_theorem (tptp.implies (tptp.implies @t7 @t2) @t2))))
% 13.13/13.40  (assume @p4 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 (tptp.implies @t7 @t1)))))
% 13.13/13.40  (assume @p5 (not @t13))
% 13.13/13.40  (step @p6 :rule instantiate :premises (@p2) :args ((@list @t11 @t14 @t10)))
% 13.13/13.40  (step @p7 :rule instantiate :premises (@p1) :args ((@list @t15 @t12)))
% 13.13/13.40  (step @p8 :rule instantiate :premises (@p2) :args ((@list @t8 @t9 tptp.u)))
% 13.13/13.40  (step @p9 :rule cnf_or_pos :args (@t21))
% 13.13/13.40  (step @p10 :rule reordering :premises (@p9) :args ((or @t13 @t17 @t20 (not @t21))))
% 13.13/13.40  (step @p11 :rule chain_m_resolution :premises (@p10 @p5 @p8 @p7) :args (@t20 (@list true false false) (@list @t13 @t16 @t21)))
% 13.13/13.40  (step @p12 :rule instantiate :premises (@p2) :args ((@list tptp.x tptp.y tptp.z)))
% 13.13/13.40  (step @p13 :rule cnf_or_pos :args (@t27))
% 13.13/13.40  (step @p14 :rule reordering :premises (@p13) :args ((or @t24 @t19 @t26 @t28)))
% 13.13/13.40  (step @p15 :rule chain_m_resolution :premises (@p14 @p12 @p11 @p6) :args (@t28 (@list false true false) (@list @t23 @t19 @t25)))
% 13.13/13.40  (assume-push @p22 @t5)
% 13.13/13.40  (step @p17 :rule instantiate :premises (@p1) :args ((@list @t22 @t18)))
% 13.13/13.40  (step-pop @p23 :rule scope :premises (@p17))
% 13.13/13.40  (step @p18 :rule process_scope :premises (@p23) :args (@t27))
% 13.13/13.40  (step @p20 :rule implies_elim :premises (@p18))
% 13.13/13.40  (step @p21 false :rule chain_m_resolution :premises (@p20 @p15 @p1) :args (false (@list true false) (@list @t27 @t5)))
% 13.13/13.40  )
% 13.13/13.40  % SZS output end Proof
% 13.13/13.41  % cvc5 exiting
%------------------------------------------------------------------------------