TSTP Solution File: GRP160-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP160-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n012.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 16:53:28 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP160-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 26 19:28:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.19/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.19/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.1GN7H6IoYF/cvc5---1.0.5_22260.smt2
% 0.19/0.51 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.1GN7H6IoYF/cvc5---1.0.5_22260.smt2
% 0.19/0.52 (assume a0 (forall ((X $$unsorted)) (= (tptp.multiply tptp.identity X) X)))
% 0.19/0.52 (assume a1 (forall ((X $$unsorted)) (= (tptp.multiply (tptp.inverse X) X) tptp.identity)))
% 0.19/0.52 (assume a2 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply (tptp.multiply X Y) Z) (tptp.multiply X (tptp.multiply Y Z)))))
% 0.19/0.52 (assume a3 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X Y) (tptp.greatest_lower_bound Y X))))
% 0.19/0.52 (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X Y) (tptp.least_upper_bound Y X))))
% 0.19/0.52 (assume a5 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.greatest_lower_bound Y Z)) (tptp.greatest_lower_bound (tptp.greatest_lower_bound X Y) Z))))
% 0.19/0.52 (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.least_upper_bound X (tptp.least_upper_bound Y Z)) (tptp.least_upper_bound (tptp.least_upper_bound X Y) Z))))
% 0.19/0.52 (assume a7 (forall ((X $$unsorted)) (= (tptp.least_upper_bound X X) X)))
% 0.19/0.52 (assume a8 (forall ((X $$unsorted)) (= (tptp.greatest_lower_bound X X) X)))
% 0.19/0.52 (assume a9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.least_upper_bound X (tptp.greatest_lower_bound X Y)) X)))
% 0.19/0.52 (assume a10 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.greatest_lower_bound X (tptp.least_upper_bound X Y)) X)))
% 0.19/0.52 (assume a11 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply X (tptp.least_upper_bound Y Z)) (tptp.least_upper_bound (tptp.multiply X Y) (tptp.multiply X Z)))))
% 0.19/0.52 (assume a12 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply X (tptp.greatest_lower_bound Y Z)) (tptp.greatest_lower_bound (tptp.multiply X Y) (tptp.multiply X Z)))))
% 0.19/0.52 (assume a13 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (= (tptp.multiply (tptp.least_upper_bound Y Z) X) (tptp.least_upper_bound (tptp.multiply Y X) (tptp.multiply Z X)))))
% 0.19/0.52 (assume a14 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (= (tptp.multiply (tptp.greatest_lower_bound Y Z) X) (tptp.greatest_lower_bound (tptp.multiply Y X) (tptp.multiply Z X)))))
% 0.19/0.52 (assume a15 (not (= (tptp.least_upper_bound tptp.a tptp.a) tptp.a)))
% 0.19/0.52 (step t1 (cl (=> (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X)))) :rule implies_neg1)
% 0.19/0.52 (anchor :step t2)
% 0.19/0.52 (assume t2.a0 (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))))
% 0.19/0.52 (step t2.t1 (cl (or (not (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X)))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a)))) :rule forall_inst :args ((:= X tptp.a)))
% 0.19/0.52 (step t2.t2 (cl (not (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X)))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) :rule or :premises (t2.t1))
% 0.19/0.52 (step t2.t3 (cl (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) :rule resolution :premises (t2.t2 t2.a0))
% 0.19/0.52 (step t2 (cl (not (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X)))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) :rule subproof :discharge (t2.a0))
% 0.19/0.52 (step t3 (cl (=> (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) :rule resolution :premises (t1 t2))
% 0.19/0.52 (step t4 (cl (=> (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) (not (= tptp.a (tptp.least_upper_bound tptp.a tptp.a)))) :rule implies_neg2)
% 0.19/0.52 (step t5 (cl (=> (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) (=> (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a)))) :rule resolution :premises (t3 t4))
% 0.19/0.52 (step t6 (cl (=> (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a)))) :rule contraction :premises (t5))
% 0.19/0.52 (step t7 (cl (not (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X)))) (= tptp.a (tptp.least_upper_bound tptp.a tptp.a))) :rule implies :premises (t6))
% 0.19/0.52 (step t8 (cl (= tptp.a (tptp.least_upper_bound tptp.a tptp.a)) (not (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))))) :rule reordering :premises (t7))
% 0.19/0.52 (step t9 (cl (not (= tptp.a (tptp.least_upper_bound tptp.a tptp.a)))) :rule not_symm :premises (a15))
% 0.19/0.52 (step t10 (cl (not (= (forall ((X $$unsorted)) (= (tptp.least_upper_bound X X) X)) (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))))) (not (forall ((X $$unsorted)) (= (tptp.least_upper_bound X X) X))) (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X)))) :rule equiv_pos2)
% 0.19/0.52 (anchor :step t11 :args ((X $$unsorted) (:= X X)))
% 0.19/0.52 (step t11.t1 (cl (= X X)) :rule refl)
% 0.19/0.52 (step t11.t2 (cl (= (= (tptp.least_upper_bound X X) X) (= X (tptp.least_upper_bound X X)))) :rule all_simplify)
% 0.19/0.52 (step t11 (cl (= (forall ((X $$unsorted)) (= (tptp.least_upper_bound X X) X)) (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X))))) :rule bind)
% 0.19/0.52 (step t12 (cl (forall ((X $$unsorted)) (= X (tptp.least_upper_bound X X)))) :rule resolution :premises (t10 t11 a7))
% 0.19/0.52 (step t13 (cl) :rule resolution :premises (t8 t9 t12))
% 0.19/0.52
% 0.19/0.52 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.1GN7H6IoYF/cvc5---1.0.5_22260.smt2
% 0.19/0.52 % cvc5---1.0.5 exiting
% 0.19/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------