↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n018.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:18 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL172-1 : TPTP v9.3.1. Released v1.1.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 : n018.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 : Fri Sep  4 22:06:48 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.44  %----Proving TF0_NAR, FOF, or CNF
% 0.10/0.46  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.19/0.50  % SZS status Unsatisfiable
% 0.19/0.50  % SZS output start Proof
% 0.19/0.51  (
% 0.19/0.51  (declare-sort $$unsorted 0)
% 0.19/0.51  (declare-const tptp.q $$unsorted)
% 0.19/0.51  (declare-const tptp.r $$unsorted)
% 0.19/0.51  (declare-const tptp.theorem (-> $$unsorted Bool))
% 0.19/0.51  (declare-const tptp.p $$unsorted)
% 0.19/0.51  (declare-const tptp.axiom (-> $$unsorted Bool))
% 0.19/0.51  (declare-const tptp.not (-> $$unsorted $$unsorted))
% 0.19/0.51  (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted))
% 0.19/0.51  (define @t1 () (@var "A" $$unsorted))
% 0.19/0.51  (define @t2 () (@var "B" $$unsorted))
% 0.19/0.51  (define @t3 () (tptp.or @t2 @t1))
% 0.19/0.51  (define @t4 () (tptp.not @t1))
% 0.19/0.51  (define @t5 () (@list @t1 @t2))
% 0.19/0.51  (define @t6 () (@var "C" $$unsorted))
% 0.19/0.51  (define @t7 () (@list @t1 @t2 @t6))
% 0.19/0.51  (define @t8 () (@var "X" $$unsorted))
% 0.19/0.51  (define @t9 () (tptp.theorem @t8))
% 0.19/0.51  (define @t10 () (@var "Y" $$unsorted))
% 0.19/0.51  (define @t11 () (tptp.not @t10))
% 0.19/0.51  (define @t12 () (@var "Z" $$unsorted))
% 0.19/0.51  (define @t13 () (tptp.not @t8))
% 0.19/0.51  (define @t14 () (tptp.not tptp.p))
% 0.19/0.51  (define @t15 () (tptp.not tptp.q))
% 0.19/0.51  (define @t16 () (tptp.or (tptp.not (tptp.or @t14 (tptp.or @t15 tptp.r))) (tptp.or @t15 (tptp.or @t14 tptp.r))))
% 0.19/0.51  (define @t17 () (tptp.theorem @t16))
% 0.19/0.51  (define @t18 () (tptp.axiom @t16))
% 0.19/0.51  (define @t19 () (not @t18))
% 0.19/0.51  (define @t20 () (or @t17 @t19))
% 0.19/0.51  (assume @p1 (forall (@list @t1) (tptp.axiom (tptp.or (tptp.not (tptp.or @t1 @t1)) @t1))))
% 0.19/0.51  (assume @p2 (forall @t5 (tptp.axiom (tptp.or @t4 @t3))))
% 0.19/0.51  (assume @p3 (forall @t5 (tptp.axiom (tptp.or (tptp.not (tptp.or @t1 @t2)) @t3))))
% 0.19/0.51  (assume @p4 (forall @t7 (tptp.axiom (tptp.or (tptp.not (tptp.or @t1 (tptp.or @t2 @t6))) (tptp.or @t2 (tptp.or @t1 @t6))))))
% 0.19/0.51  (assume @p5 (forall @t7 (tptp.axiom (tptp.or (tptp.not (tptp.or @t4 @t2)) (tptp.or (tptp.not (tptp.or @t6 @t1)) (tptp.or @t6 @t2))))))
% 0.19/0.51  (assume @p6 (forall (@list @t8) (or @t9 (not (tptp.axiom @t8)))))
% 0.19/0.51  (assume @p7 (forall (@list @t8 @t10) (or @t9 (not (tptp.axiom (tptp.or @t11 @t8))) (not (tptp.theorem @t10)))))
% 0.19/0.51  (assume @p8 (forall (@list @t8 @t12 @t10) (or (tptp.theorem (tptp.or @t13 @t12)) (not (tptp.axiom (tptp.or @t13 @t10))) (not (tptp.theorem (tptp.or @t11 @t12))))))
% 0.19/0.51  (assume @p9 (not @t17))
% 0.19/0.51  (step @p10 :rule instantiate :premises (@p4) :args ((@list @t14 @t15 tptp.r)))
% 0.19/0.51  (step @p11 :rule instantiate :premises (@p6) :args ((@list @t16)))
% 0.19/0.51  (step @p12 :rule cnf_or_pos :args (@t20))
% 0.19/0.51  (step @p13 :rule reordering :premises (@p12) :args ((or @t17 @t19 (not @t20))))
% 0.19/0.51  (step @p14 false :rule chain_m_resolution :premises (@p13 @p11 @p10 @p9) :args (false (@list false false true) (@list @t20 @t18 @t17)))
% 0.19/0.51  )
% 0.19/0.51  % SZS output end Proof
% 0.19/0.51  % cvc5 exiting
%------------------------------------------------------------------------------