TSTP Solution File: DAT036_1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : DAT036_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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 : Fri Sep 16 14:36:28 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT036_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Aug 31 01:45:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 tff(count_type, type, (
% 0.20/0.39 count: collection > $int)).
% 0.20/0.39 tff(add_type, type, (
% 0.20/0.39 add: ( $int * collection ) > collection)).
% 0.20/0.39 tff(tptp_fun_U_2_type, type, (
% 0.20/0.39 tptp_fun_U_2: collection)).
% 0.20/0.39 tff(tptp_fun_V_1_type, type, (
% 0.20/0.39 tptp_fun_V_1: $int)).
% 0.20/0.39 tff(in_type, type, (
% 0.20/0.39 in: ( $int * collection ) > $o)).
% 0.20/0.39 tff(tptp_fun_W_0_type, type, (
% 0.20/0.39 tptp_fun_W_0: $int)).
% 0.20/0.39 tff(1,plain,
% 0.20/0.39 (^[X8: $int, X9: collection] : refl(((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1)) <=> ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(2,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1)) <=> ![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.39 tff(3,plain,
% 0.20/0.39 (^[X8: $int, X9: collection] : rewrite(((~in(X8, X9)) <=> ($sum(count(add(X8, X9)), $product(-1, count(X9))) = 1)) <=> ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(4,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(add(X8, X9)), $product(-1, count(X9))) = 1)) <=> ![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[3])).
% 0.20/0.39 tff(5,plain,
% 0.20/0.39 (^[X8: $int, X9: collection] : rewrite(((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9)))) <=> ((~in(X8, X9)) <=> ($sum(count(add(X8, X9)), $product(-1, count(X9))) = 1)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(6,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9)))) <=> ![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(add(X8, X9)), $product(-1, count(X9))) = 1))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[5])).
% 0.20/0.39 tff(7,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9)))) <=> ![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9))))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(8,plain,
% 0.20/0.39 (^[X8: $int, X9: collection] : rewrite(((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(count(X9), 1))) <=> ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9)))))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(9,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(count(X9), 1))) <=> ![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9))))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[8])).
% 0.20/0.39 tff(10,axiom,(![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(count(X9), 1)))), file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax','ax3')).
% 0.20/0.39 tff(11,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9))))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[10, 9])).
% 0.20/0.39 tff(12,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> (count(add(X8, X9)) = $sum(1, count(X9))))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[11, 7])).
% 0.20/0.39 tff(13,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(add(X8, X9)), $product(-1, count(X9))) = 1))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[12, 6])).
% 0.20/0.39 tff(14,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[13, 4])).
% 0.20/0.39 tff(15,plain,(
% 0.20/0.39 ![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1))),
% 0.20/0.39 inference(skolemize,[status(sab)],[14])).
% 0.20/0.39 tff(16,plain,
% 0.20/0.39 (![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[15, 2])).
% 0.20/0.39 tff(17,plain,
% 0.20/0.39 ((~![X8: $int, X9: collection] : ((~in(X8, X9)) <=> ($sum(count(X9), $product(-1, count(add(X8, X9)))) = -1))) | ((~in(V!1, U!2)) <=> ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = -1))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(18,plain,
% 0.20/0.39 ((~in(V!1, U!2)) <=> ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = -1)),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[17, 16])).
% 0.20/0.39 tff(19,plain,
% 0.20/0.39 (^[X10: $int, X11: collection] : refl((in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0)) <=> (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(20,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0)) <=> ![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[19])).
% 0.20/0.39 tff(21,plain,
% 0.20/0.39 (^[X10: $int, X11: collection] : rewrite((in(X10, X11) <=> ($sum(count(add(X10, X11)), $product(-1, count(X11))) = 0)) <=> (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(22,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(add(X10, X11)), $product(-1, count(X11))) = 0)) <=> ![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[21])).
% 0.20/0.39 tff(23,plain,
% 0.20/0.39 (^[X10: $int, X11: collection] : rewrite((in(X10, X11) <=> (count(add(X10, X11)) = count(X11))) <=> (in(X10, X11) <=> ($sum(count(add(X10, X11)), $product(-1, count(X11))) = 0)))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(24,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> (count(add(X10, X11)) = count(X11))) <=> ![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(add(X10, X11)), $product(-1, count(X11))) = 0))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[23])).
% 0.20/0.39 tff(25,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> (count(add(X10, X11)) = count(X11))) <=> ![X10: $int, X11: collection] : (in(X10, X11) <=> (count(add(X10, X11)) = count(X11)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(26,axiom,(![X10: $int, X11: collection] : (in(X10, X11) <=> (count(add(X10, X11)) = count(X11)))), file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax','ax4')).
% 0.20/0.39 tff(27,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> (count(add(X10, X11)) = count(X11)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.20/0.39 tff(28,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(add(X10, X11)), $product(-1, count(X11))) = 0))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[27, 24])).
% 0.20/0.39 tff(29,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[28, 22])).
% 0.20/0.39 tff(30,plain,(
% 0.20/0.39 ![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))),
% 0.20/0.39 inference(skolemize,[status(sab)],[29])).
% 0.20/0.39 tff(31,plain,
% 0.20/0.39 (![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[30, 20])).
% 0.20/0.39 tff(32,plain,
% 0.20/0.39 (((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0))) <=> ((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(33,plain,
% 0.20/0.39 ((in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, U!2)), $product(-1, count(add(V!1, add(V!1, U!2))))) = 0)) <=> (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(34,plain,
% 0.20/0.39 (((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, U!2)), $product(-1, count(add(V!1, add(V!1, U!2))))) = 0))) <=> ((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0)))),
% 0.20/0.40 inference(monotonicity,[status(thm)],[33])).
% 0.20/0.40 tff(35,plain,
% 0.20/0.40 (((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, U!2)), $product(-1, count(add(V!1, add(V!1, U!2))))) = 0))) <=> ((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0)))),
% 0.20/0.40 inference(transitivity,[status(thm)],[34, 32])).
% 0.20/0.40 tff(36,plain,
% 0.20/0.40 ((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, U!2)), $product(-1, count(add(V!1, add(V!1, U!2))))) = 0))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(37,plain,
% 0.20/0.40 ((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[36, 35])).
% 0.20/0.40 tff(38,plain,
% 0.20/0.40 (in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[37, 31])).
% 0.20/0.40 tff(39,plain,
% 0.20/0.40 (^[V: $int, W: collection] : refl(in(V, add(V, W)) <=> in(V, add(V, W)))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(40,plain,
% 0.20/0.40 (![V: $int, W: collection] : in(V, add(V, W)) <=> ![V: $int, W: collection] : in(V, add(V, W))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[39])).
% 0.20/0.40 tff(41,plain,
% 0.20/0.40 (![V: $int, W: collection] : in(V, add(V, W)) <=> ![V: $int, W: collection] : in(V, add(V, W))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(42,axiom,(![V: $int, W: collection] : in(V, add(V, W))), file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=0.ax','ax2')).
% 0.20/0.40 tff(43,plain,
% 0.20/0.40 (![V: $int, W: collection] : in(V, add(V, W))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[42, 41])).
% 0.20/0.40 tff(44,plain,(
% 0.20/0.40 ![V: $int, W: collection] : in(V, add(V, W))),
% 0.20/0.40 inference(skolemize,[status(sab)],[43])).
% 0.20/0.40 tff(45,plain,
% 0.20/0.40 (![V: $int, W: collection] : in(V, add(V, W))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[44, 40])).
% 0.20/0.40 tff(46,plain,
% 0.20/0.40 ((~![V: $int, W: collection] : in(V, add(V, W))) | in(V!1, add(V!1, U!2))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(47,plain,
% 0.20/0.40 (in(V!1, add(V!1, U!2))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[46, 45])).
% 0.20/0.40 tff(48,plain,
% 0.20/0.40 ((~(in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0))) | (~in(V!1, add(V!1, U!2))) | ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0)),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(49,plain,
% 0.20/0.40 ((~(in(V!1, add(V!1, U!2)) <=> ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0))) | ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[48, 47])).
% 0.20/0.40 tff(50,plain,
% 0.20/0.40 ($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[49, 38])).
% 0.20/0.40 tff(51,plain,
% 0.20/0.40 ((~($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))) = 0)) | $lesseq($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))), 0)),
% 0.20/0.40 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.40 tff(52,plain,
% 0.20/0.40 ($lesseq($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))), 0)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[51, 50])).
% 0.20/0.40 tff(53,plain,
% 0.20/0.40 ((~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(W, $sum($product(-1, count(add(V, add(V, U)))), count(U))), 0))) <=> (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(W, $sum($product(-1, count(add(V, add(V, U)))), count(U))), 0)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(54,plain,
% 0.20/0.40 ((~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), $sum(W, $product(-1, count(add(V, add(V, U)))))), 0))) <=> (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(W, $sum($product(-1, count(add(V, add(V, U)))), count(U))), 0)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(55,plain,
% 0.20/0.40 ((~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U)))))) <=> (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), $sum(W, $product(-1, count(add(V, add(V, U)))))), 0)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(56,plain,
% 0.20/0.40 ((~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U)))))) <=> (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U))))))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(57,plain,
% 0.20/0.40 ((~![U: collection, V: $int, W: $int] : ($greater(W, 0) => $greatereq($sum(count(U), W), count(add(V, add(V, U)))))) <=> (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U))))))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(58,axiom,(~![U: collection, V: $int, W: $int] : ($greater(W, 0) => $greatereq($sum(count(U), W), count(add(V, add(V, U)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','co1')).
% 0.20/0.40 tff(59,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[58, 57])).
% 0.20/0.40 tff(60,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[59, 56])).
% 0.20/0.40 tff(61,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[60, 56])).
% 0.20/0.40 tff(62,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), W), count(add(V, add(V, U)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[61, 56])).
% 0.20/0.40 tff(63,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(count(U), $sum(W, $product(-1, count(add(V, add(V, U)))))), 0))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[62, 55])).
% 0.20/0.40 tff(64,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(W, $sum($product(-1, count(add(V, add(V, U)))), count(U))), 0))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[63, 54])).
% 0.20/0.40 tff(65,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(W, $sum($product(-1, count(add(V, add(V, U)))), count(U))), 0))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[64, 53])).
% 0.20/0.40 tff(66,plain,
% 0.20/0.40 (~![U: collection, V: $int, W: $int] : ($lesseq(W, 0) | $greatereq($sum(W, $sum($product(-1, count(add(V, add(V, U)))), count(U))), 0))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[65, 53])).
% 0.20/0.40 tff(67,plain,(
% 0.20/0.40 ~($lesseq(W!0, 0) | $greatereq($sum(W!0, $sum($product(-1, count(add(V!1, add(V!1, U!2)))), count(U!2))), 0))),
% 0.20/0.40 inference(skolemize,[status(sab)],[66])).
% 0.20/0.40 tff(68,plain,
% 0.20/0.40 (~$lesseq(W!0, 0)),
% 0.20/0.40 inference(or_elim,[status(thm)],[67])).
% 0.20/0.40 tff(69,plain,
% 0.20/0.40 (~$greatereq($sum(W!0, $sum($product(-1, count(add(V!1, add(V!1, U!2)))), count(U!2))), 0)),
% 0.20/0.40 inference(or_elim,[status(thm)],[67])).
% 0.20/0.40 tff(70,plain,
% 0.20/0.40 ((~$greatereq($sum(count(U!2), $product(-1, count(add(V!1, U!2)))), -1)) | (~$lesseq($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))), 0)) | $lesseq(W!0, 0) | $greatereq($sum(W!0, $sum($product(-1, count(add(V!1, add(V!1, U!2)))), count(U!2))), 0)),
% 0.20/0.40 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.40 tff(71,plain,
% 0.20/0.40 (~$greatereq($sum(count(U!2), $product(-1, count(add(V!1, U!2)))), -1)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[70, 69, 68, 52])).
% 0.20/0.40 tff(72,plain,
% 0.20/0.40 ((~($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = -1)) | $greatereq($sum(count(U!2), $product(-1, count(add(V!1, U!2)))), -1)),
% 0.20/0.40 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.40 tff(73,plain,
% 0.20/0.40 (~($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = -1)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[72, 71])).
% 0.20/0.40 tff(74,plain,
% 0.20/0.40 ((~![X10: $int, X11: collection] : (in(X10, X11) <=> ($sum(count(X11), $product(-1, count(add(X10, X11)))) = 0))) | (in(V!1, U!2) <=> ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = 0))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(75,plain,
% 0.20/0.40 (in(V!1, U!2) <=> ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = 0)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[74, 31])).
% 0.20/0.40 tff(76,plain,
% 0.20/0.40 ($lesseq($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))), 1) | (~$lesseq($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))), 0))),
% 0.20/0.40 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.40 tff(77,plain,
% 0.20/0.40 ($lesseq($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))), 1)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[76, 52])).
% 0.20/0.40 tff(78,plain,
% 0.20/0.40 ((~$greatereq($sum(count(U!2), $product(-1, count(add(V!1, U!2)))), 0)) | (~$lesseq($sum(count(add(V!1, add(V!1, U!2))), $product(-1, count(add(V!1, U!2)))), 1)) | $lesseq(W!0, 0) | $greatereq($sum(W!0, $sum($product(-1, count(add(V!1, add(V!1, U!2)))), count(U!2))), 0)),
% 0.20/0.40 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.40 tff(79,plain,
% 0.20/0.40 (~$greatereq($sum(count(U!2), $product(-1, count(add(V!1, U!2)))), 0)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[78, 69, 68, 77])).
% 0.20/0.40 tff(80,plain,
% 0.20/0.40 ((~($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = 0)) | $greatereq($sum(count(U!2), $product(-1, count(add(V!1, U!2)))), 0)),
% 0.20/0.40 inference(theory_lemma,[status(thm)],[])).
% 0.20/0.40 tff(81,plain,
% 0.20/0.40 (~($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = 0)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[80, 79])).
% 0.20/0.40 tff(82,plain,
% 0.20/0.40 ((~(in(V!1, U!2) <=> ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = 0))) | (~in(V!1, U!2)) | ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = 0)),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(83,plain,
% 0.20/0.40 (~in(V!1, U!2)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[82, 81, 75])).
% 0.20/0.40 tff(84,plain,
% 0.20/0.40 ((~((~in(V!1, U!2)) <=> ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = -1))) | in(V!1, U!2) | ($sum(count(U!2), $product(-1, count(add(V!1, U!2)))) = -1)),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(85,plain,
% 0.20/0.40 ($false),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[84, 83, 73, 18])).
% 0.20/0.40 % SZS output end Proof
%------------------------------------------------------------------------------