TSTP Solution File: LAT039-2 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : LAT039-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n022.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:20:09 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : LAT039-2 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n022.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 15:50:24 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.cEu6Na8St7/cvc5---1.0.5_30750.smt2
% 0.20/0.52  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.cEu6Na8St7/cvc5---1.0.5_30750.smt2
% 0.20/0.52  (assume a0 (forall ((X $$unsorted)) (= (tptp.meet X X) X)))
% 0.20/0.52  (assume a1 (forall ((X $$unsorted)) (= (tptp.join X X) X)))
% 0.20/0.52  (assume a2 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.meet X (tptp.join X Y)) X)))
% 0.20/0.52  (assume a3 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.join X (tptp.meet X Y)) X)))
% 0.20/0.52  (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.meet X Y) (tptp.meet Y X))))
% 0.20/0.52  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.join X Y) (tptp.join Y X))))
% 0.20/0.52  (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.meet (tptp.meet X Y) Z) (tptp.meet X (tptp.meet Y Z)))))
% 0.20/0.52  (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join (tptp.join X Y) Z) (tptp.join X (tptp.join Y Z)))))
% 0.20/0.52  (assume a8 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))))
% 0.20/0.52  (assume a9 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.meet X (tptp.join Y Z)) (tptp.join (tptp.meet X Y) (tptp.meet X Z)))))
% 0.20/0.52  (assume a10 (= (tptp.join tptp.xx tptp.yy) tptp.yy))
% 0.20/0.52  (assume a11 (not (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))))
% 0.20/0.52  (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z))))) :rule implies_neg1)
% 0.20/0.52  (anchor :step t2)
% 0.20/0.52  (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))))
% 0.20/0.52  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z))))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz))))) :rule forall_inst :args ((:= X tptp.xx) (:= Y tptp.yy) (:= Z tptp.zz)))
% 0.20/0.52  (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z))))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) :rule or :premises (t2.t1))
% 0.20/0.52  (step t2.t3 (cl (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.20/0.52  (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z))))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) :rule subproof :discharge (t2.a0))
% 0.20/0.52  (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) :rule resolution :premises (t1 t2))
% 0.20/0.52  (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) (not (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz))))) :rule implies_neg2)
% 0.20/0.52  (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz))))) :rule resolution :premises (t3 t4))
% 0.20/0.52  (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz))))) :rule contraction :premises (t5))
% 0.20/0.52  (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z))))) (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz)))) :rule implies :premises (t6))
% 0.20/0.52  (step t8 (cl (= (tptp.join tptp.xx (tptp.meet tptp.yy tptp.zz)) (tptp.meet (tptp.join tptp.xx tptp.yy) (tptp.join tptp.xx tptp.zz))) (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.join X (tptp.meet Y Z)) (tptp.meet (tptp.join X Y) (tptp.join X Z)))))) :rule reordering :premises (t7))
% 0.20/0.52  (step t9 (cl) :rule resolution :premises (t8 a11 a8))
% 0.20/0.52  
% 0.34/0.53  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.cEu6Na8St7/cvc5---1.0.5_30750.smt2
% 0.34/0.53  % cvc5---1.0.5 exiting
% 0.34/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------