TSTP Solution File: LCL169-1 by cvc5---1.0.5

View Problem - Process Solution 
%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : LCL169-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 17:24:42 EDT 2024

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : LCL169-1 : TPTP v8.2.0. Released v1.1.0.
% 0.08/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 27 19:39:39 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.Su9Du7jrOT/cvc5---1.0.5_10706.smt2
% 0.21/0.52  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.Su9Du7jrOT/cvc5---1.0.5_10706.smt2
% 0.21/0.52  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 0.21/0.52  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))))
% 0.21/0.52  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 0.21/0.52  (assume a3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))))
% 0.21/0.52  (assume a4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))))
% 0.21/0.52  (assume a5 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.21/0.52  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 0.21/0.52  (assume a7 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))))
% 0.21/0.52  (assume a8 (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))
% 0.21/0.52  (step t1 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule or_pos)
% 0.21/0.52  (step t2 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule reordering :premises (t1))
% 0.21/0.52  (step t3 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 0.21/0.52  (anchor :step t4)
% 0.21/0.52  (assume t4.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.21/0.52  (step t4.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))
% 0.21/0.52  (step t4.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule or :premises (t4.t1))
% 0.21/0.52  (step t4.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t4.t2 t4.a0))
% 0.21/0.52  (step t4 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule subproof :discharge (t4.a0))
% 0.21/0.52  (step t5 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t3 t4))
% 0.21/0.53  (step t6 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule implies_neg2)
% 0.21/0.53  (step t7 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule resolution :premises (t5 t6))
% 0.21/0.53  (step t8 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule contraction :premises (t7))
% 0.21/0.53  (step t9 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule implies :premises (t8))
% 0.21/0.53  (step t10 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t9 a5))
% 0.21/0.53  (step t11 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t12)
% 0.21/0.53  (assume t12.a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 0.21/0.53  (step t12.t1 (cl (or (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule forall_inst :args ((:= A (tptp.not tptp.p))))
% 0.21/0.53  (step t12.t2 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule or :premises (t12.t1))
% 0.21/0.53  (step t12.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t12.t2 t12.a0))
% 0.21/0.53  (step t12 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule subproof :discharge (t12.a0))
% 0.21/0.53  (step t13 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t11 t12))
% 0.21/0.53  (step t14 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule implies_neg2)
% 0.21/0.53  (step t15 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule resolution :premises (t13 t14))
% 0.21/0.53  (step t16 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule contraction :premises (t15))
% 0.21/0.53  (step t17 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule implies :premises (t16))
% 0.21/0.53  (step t18 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t17 a0))
% 0.21/0.53  (step t19 (cl) :rule resolution :premises (t2 t10 t18 a8))
% 0.21/0.53  
% 0.21/0.53  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.Su9Du7jrOT/cvc5---1.0.5_10706.smt2
% 0.21/0.53  % cvc5---1.0.5 exiting
% 0.21/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------