↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n016.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:25 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  : LCL212-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36  % Computer : n016.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep  5 20:20:45 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.13/0.42  %----Proving TF0_NAR, FOF, or CNF
% 0.13/0.44  --- 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.50  (
% 0.19/0.50  (declare-sort $$unsorted 0)
% 0.19/0.50  (declare-const tptp.q $$unsorted)
% 0.19/0.50  (declare-const tptp.theorem (-> $$unsorted Bool))
% 0.19/0.50  (declare-const tptp.not (-> $$unsorted $$unsorted))
% 0.19/0.50  (declare-const tptp.p $$unsorted)
% 0.19/0.50  (declare-const tptp.axiom (-> $$unsorted Bool))
% 0.19/0.50  (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted))
% 0.19/0.50  (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted))
% 0.19/0.50  (define @t1 () (@var "A" $$unsorted))
% 0.19/0.50  (define @t2 () (@var "B" $$unsorted))
% 0.19/0.50  (define @t3 () (tptp.or @t2 @t1))
% 0.19/0.50  (define @t4 () (@list @t1 @t2))
% 0.19/0.50  (define @t5 () (@var "C" $$unsorted))
% 0.19/0.50  (define @t6 () (@list @t1 @t2 @t5))
% 0.19/0.50  (define @t7 () (@var "Y" $$unsorted))
% 0.19/0.50  (define @t8 () (@var "X" $$unsorted))
% 0.19/0.50  (define @t9 () (@list @t8 @t7))
% 0.19/0.50  (define @t10 () (tptp.theorem @t8))
% 0.19/0.50  (define @t11 () (tptp.implies tptp.p tptp.q))
% 0.19/0.50  (define @t12 () (tptp.implies tptp.q (tptp.implies @t11 tptp.q)))
% 0.19/0.50  (define @t13 () (tptp.not tptp.p))
% 0.19/0.50  (define @t14 () (tptp.theorem (tptp.implies @t13 @t12)))
% 0.19/0.50  (define @t15 () (tptp.not @t13))
% 0.19/0.50  (define @t16 () (tptp.or @t15 @t12))
% 0.19/0.50  (define @t17 () (tptp.implies @t12 @t16))
% 0.19/0.50  (define @t18 () (tptp.axiom @t17))
% 0.19/0.50  (define @t19 () (not @t18))
% 0.19/0.50  (define @t20 () (tptp.theorem @t17))
% 0.19/0.50  (define @t21 () (or @t20 @t19))
% 0.19/0.50  (define @t22 () (@list false false))
% 0.19/0.50  (define @t23 () (tptp.axiom @t12))
% 0.19/0.50  (define @t24 () (not @t23))
% 0.19/0.50  (define @t25 () (tptp.theorem @t12))
% 0.19/0.50  (define @t26 () (or @t25 @t24))
% 0.19/0.50  (define @t27 () (not @t25))
% 0.19/0.50  (define @t28 () (not @t20))
% 0.19/0.50  (define @t29 () (tptp.theorem @t16))
% 0.19/0.50  (define @t30 () (or @t29 @t28 @t27))
% 0.19/0.50  (assume @p1 (forall (@list @t1) (tptp.axiom (tptp.implies (tptp.or @t1 @t1) @t1))))
% 0.19/0.50  (assume @p2 (forall @t4 (tptp.axiom (tptp.implies @t1 @t3))))
% 0.19/0.50  (assume @p3 (forall @t4 (tptp.axiom (tptp.implies (tptp.or @t1 @t2) @t3))))
% 0.19/0.50  (assume @p4 (forall @t6 (tptp.axiom (tptp.implies (tptp.or @t1 (tptp.or @t2 @t5)) (tptp.or @t2 (tptp.or @t1 @t5))))))
% 0.19/0.50  (assume @p5 (forall @t6 (tptp.axiom (tptp.implies (tptp.implies @t1 @t2) (tptp.implies (tptp.or @t5 @t1) (tptp.or @t5 @t2))))))
% 0.19/0.50  (assume @p6 (forall @t9 (= (tptp.implies @t8 @t7) (tptp.or (tptp.not @t8) @t7))))
% 0.19/0.50  (assume @p7 (forall (@list @t8) (or @t10 (not (tptp.axiom @t8)))))
% 0.19/0.50  (assume @p8 (forall @t9 (or @t10 (not (tptp.theorem (tptp.implies @t7 @t8))) (not (tptp.theorem @t7)))))
% 0.19/0.50  (assume @p9 (not @t14))
% 0.19/0.50  (step @p10 :rule evaluate :args ((= false true)))
% 0.19/0.50  (step @p11 :rule instantiate :premises (@p8) :args ((@list @t16 @t12)))
% 0.19/0.50  (step @p12 :rule instantiate :premises (@p7) :args ((@list @t17)))
% 0.19/0.50  (step @p13 :rule instantiate :premises (@p2) :args ((@list @t12 @t15)))
% 0.19/0.50  (step @p14 :rule cnf_or_pos :args (@t21))
% 0.19/0.50  (step @p15 :rule reordering :premises (@p14) :args ((or @t19 @t20 (not @t21))))
% 0.19/0.50  (step @p16 :rule chain_m_resolution :premises (@p15 @p13 @p12) :args (@t20 @t22 (@list @t18 @t21)))
% 0.19/0.50  (step @p17 :rule instantiate :premises (@p7) :args ((@list @t12)))
% 0.19/0.50  (step @p18 :rule instantiate :premises (@p2) :args ((@list tptp.q (tptp.not @t11))))
% 0.19/0.50  (step @p19 :rule true_intro :premises (@p18))
% 0.19/0.50  (step @p20 :rule instantiate :premises (@p6) :args ((@list @t11 tptp.q)))
% 0.19/0.50  (step @p21 :rule refl :args (tptp.q))
% 0.19/0.50  (step @p22 :rule cong :premises (@p21 @p20) :args (@t12))
% 0.19/0.50  (step @p23 :rule cong :premises (@p22) :args (@t23))
% 0.19/0.50  (step @p24 :rule trans :premises (@p23 @p19))
% 0.19/0.50  (step @p25 :rule true_elim :premises (@p24))
% 0.19/0.50  (step @p26 :rule cnf_or_pos :args (@t26))
% 0.19/0.50  (step @p27 :rule reordering :premises (@p26) :args ((or @t25 @t24 (not @t26))))
% 0.19/0.50  (step @p28 :rule chain_m_resolution :premises (@p27 @p25 @p17) :args (@t25 @t22 (@list @t23 @t26)))
% 0.19/0.50  (step @p29 :rule cnf_or_pos :args (@t30))
% 0.19/0.50  (step @p30 :rule reordering :premises (@p29) :args ((or @t27 @t29 @t28 (not @t30))))
% 0.19/0.50  (step @p31 :rule chain_m_resolution :premises (@p30 @p28 @p16 @p11) :args (@t29 (@list false false false) (@list @t25 @t20 @t30)))
% 0.19/0.50  (step @p32 :rule true_intro :premises (@p31))
% 0.19/0.50  (step @p33 :rule instantiate :premises (@p6) :args ((@list @t13 @t12)))
% 0.19/0.50  (step @p34 :rule cong :premises (@p33) :args (@t14))
% 0.19/0.50  (step @p35 :rule false_intro :premises (@p9))
% 0.19/0.50  (step @p36 :rule symm :premises (@p35))
% 0.19/0.50  (step @p37 :rule trans :premises (@p36 @p34 @p32))
% 0.19/0.50  (step @p38 false :rule eq_resolve :premises (@p37 @p10))
% 0.19/0.50  )
% 0.19/0.51  % SZS output end Proof
% 0.19/0.51  % cvc5 exiting
%------------------------------------------------------------------------------