%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : NUM022-1 : TPTP v9.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n009.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 : Sat Jun 21 05:18:42 AM UTC 2025
% Result : Unsatisfiable 0.12s 0.36s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM022-1 : TPTP v9.0.0. Released v1.0.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 19 23:59:03 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.12/0.36 % SZS status Unsatisfiable
% 0.12/0.36 % SZS output start Proof
% 0.12/0.36 tff(less_type, type, (
% 0.12/0.36 less: ( $i * $i ) > $o)).
% 0.12/0.36 tff(d_type, type, (
% 0.12/0.36 d: $i)).
% 0.12/0.36 tff(b_type, type, (
% 0.12/0.36 b: $i)).
% 0.12/0.36 tff(equalish_type, type, (
% 0.12/0.36 equalish: ( $i * $i ) > $o)).
% 0.12/0.36 tff(add_type, type, (
% 0.12/0.36 add: ( $i * $i ) > $i)).
% 0.12/0.36 tff(a_type, type, (
% 0.12/0.36 a: $i)).
% 0.12/0.36 tff(successor_type, type, (
% 0.12/0.36 successor: $i > $i)).
% 0.12/0.36 tff(predecessor_of_1st_minus_2nd_type, type, (
% 0.12/0.36 predecessor_of_1st_minus_2nd: ( $i * $i ) > $i)).
% 0.12/0.36 tff(divides_type, type, (
% 0.12/0.36 divides: ( $i * $i ) > $o)).
% 0.12/0.36 tff(1,assumption,(equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d)), introduced(assumption)).
% 0.12/0.36 tff(2,plain,
% 0.12/0.36 ((~less(a, d)) <=> (~less(a, d))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(3,axiom,(~less(a, d)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_a_less_than_d')).
% 0.12/0.36 tff(4,plain,
% 0.12/0.36 (~less(a, d)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.12/0.36 tff(5,plain,
% 0.12/0.36 (^[B: $i, A: $i, C: $i] : refl(((~equalish(add(successor(A), B), C)) | less(B, C)) <=> ((~equalish(add(successor(A), B), C)) | less(B, C)))),
% 0.12/0.36 inference(bind,[status(th)],[])).
% 0.12/0.36 tff(6,plain,
% 0.12/0.36 (![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C)) <=> ![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))),
% 0.12/0.36 inference(quant_intro,[status(thm)],[5])).
% 0.12/0.36 tff(7,plain,
% 0.12/0.36 (![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C)) <=> ![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(8,axiom,(![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax','smaller_number')).
% 0.12/0.36 tff(9,plain,
% 0.12/0.36 (![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[8, 7])).
% 0.12/0.36 tff(10,plain,(
% 0.12/0.36 ![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))),
% 0.12/0.36 inference(skolemize,[status(sab)],[9])).
% 0.12/0.36 tff(11,plain,
% 0.12/0.36 (![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[10, 6])).
% 0.12/0.36 tff(12,plain,
% 0.12/0.36 (((~![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))) | ((~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d)) | less(a, d))) <=> ((~![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))) | (~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d)) | less(a, d))),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(13,plain,
% 0.12/0.36 ((~![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))) | ((~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d)) | less(a, d))),
% 0.12/0.36 inference(quant_inst,[status(thm)],[])).
% 0.12/0.36 tff(14,plain,
% 0.12/0.36 ((~![B: $i, A: $i, C: $i] : ((~equalish(add(successor(A), B), C)) | less(B, C))) | (~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d)) | less(a, d)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.12/0.36 tff(15,plain,
% 0.12/0.36 ($false),
% 0.12/0.36 inference(unit_resolution,[status(thm)],[14, 11, 4, 1])).
% 0.12/0.36 tff(16,plain,(~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d)), inference(lemma,lemma(discharge,[]))).
% 0.12/0.36 tff(17,assumption,(equalish(b, d)), introduced(assumption)).
% 0.12/0.36 tff(18,plain,
% 0.12/0.36 (less(a, b) <=> less(a, b)),
% 0.12/0.36 inference(rewrite,[status(thm)],[])).
% 0.12/0.36 tff(19,axiom,(less(a, b)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','a_less_than_b')).
% 0.12/0.36 tff(20,plain,
% 0.12/0.36 (less(a, b)),
% 0.12/0.36 inference(modus_ponens,[status(thm)],[19, 18])).
% 0.12/0.36 tff(21,plain,
% 0.12/0.36 (^[B: $i, A: $i] : refl(((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B)) <=> ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B)))),
% 0.12/0.36 inference(bind,[status(th)],[])).
% 0.12/0.36 tff(22,plain,
% 0.12/0.36 (![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B)) <=> ![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))),
% 0.12/0.36 inference(quant_intro,[status(thm)],[21])).
% 0.12/0.37 tff(23,plain,
% 0.12/0.37 (![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B)) <=> ![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(24,axiom,(![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax','less_lemma')).
% 0.12/0.37 tff(25,plain,
% 0.12/0.37 (![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.12/0.37 tff(26,plain,(
% 0.12/0.37 ![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))),
% 0.12/0.37 inference(skolemize,[status(sab)],[25])).
% 0.12/0.37 tff(27,plain,
% 0.12/0.37 (![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[26, 22])).
% 0.12/0.37 tff(28,plain,
% 0.12/0.37 (((~![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))) | ((~less(a, b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b))) <=> ((~![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))) | (~less(a, b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(29,plain,
% 0.12/0.37 ((~![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))) | ((~less(a, b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b))),
% 0.12/0.37 inference(quant_inst,[status(thm)],[])).
% 0.12/0.37 tff(30,plain,
% 0.12/0.37 ((~![B: $i, A: $i] : ((~less(A, B)) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B))) | (~less(a, b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b)),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.12/0.37 tff(31,plain,
% 0.12/0.37 (equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b)),
% 0.12/0.37 inference(unit_resolution,[status(thm)],[30, 27, 20])).
% 0.12/0.37 tff(32,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B))) <=> ![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(33,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B))) <=> ![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(34,plain,
% 0.12/0.37 (^[B: $i, A: $i, C: $i] : trans(monotonicity(rewrite(((~equalish(A, B)) | (~equalish(C, A))) <=> ((~equalish(C, A)) | (~equalish(A, B)))), ((((~equalish(A, B)) | (~equalish(C, A))) | equalish(C, B)) <=> (((~equalish(C, A)) | (~equalish(A, B))) | equalish(C, B)))), rewrite((((~equalish(C, A)) | (~equalish(A, B))) | equalish(C, B)) <=> ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))), ((((~equalish(A, B)) | (~equalish(C, A))) | equalish(C, B)) <=> ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))))),
% 0.12/0.37 inference(bind,[status(th)],[])).
% 0.12/0.37 tff(35,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : (((~equalish(A, B)) | (~equalish(C, A))) | equalish(C, B)) <=> ![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))),
% 0.12/0.37 inference(quant_intro,[status(thm)],[34])).
% 0.12/0.37 tff(36,axiom,(![B: $i, A: $i, C: $i] : (((~equalish(A, B)) | (~equalish(C, A))) | equalish(C, B))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','transitivity')).
% 0.12/0.37 tff(37,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[36, 35])).
% 0.12/0.37 tff(38,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[37, 33])).
% 0.12/0.37 tff(39,plain,(
% 0.12/0.37 ![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))),
% 0.12/0.37 inference(skolemize,[status(sab)],[38])).
% 0.12/0.37 tff(40,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[39, 32])).
% 0.12/0.37 tff(41,plain,
% 0.12/0.37 (((~![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))) | ((~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d) | (~equalish(b, d)))) <=> ((~![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))) | (~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d) | (~equalish(b, d)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(42,plain,
% 0.12/0.37 ((~![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))) | ((~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d) | (~equalish(b, d)))),
% 0.12/0.37 inference(quant_inst,[status(thm)],[])).
% 0.12/0.37 tff(43,plain,
% 0.12/0.37 ((~![B: $i, A: $i, C: $i] : ((~equalish(C, A)) | equalish(C, B) | (~equalish(A, B)))) | (~equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), b)) | equalish(add(successor(predecessor_of_1st_minus_2nd(b, a)), a), d) | (~equalish(b, d))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[42, 41])).
% 0.12/0.37 tff(44,plain,
% 0.12/0.37 ($false),
% 0.12/0.37 inference(unit_resolution,[status(thm)],[43, 40, 31, 17, 16])).
% 0.12/0.37 tff(45,plain,(~equalish(b, d)), inference(lemma,lemma(discharge,[]))).
% 0.12/0.37 tff(46,plain,
% 0.12/0.37 (divides(b, d) <=> divides(b, d)),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(47,axiom,(divides(b, d)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','b_divides_d')).
% 0.12/0.37 tff(48,plain,
% 0.12/0.37 (divides(b, d)),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[47, 46])).
% 0.12/0.37 tff(49,plain,
% 0.12/0.37 (^[B: $i, A: $i] : refl((equalish(A, B) | less(A, B) | (~divides(A, B))) <=> (equalish(A, B) | less(A, B) | (~divides(A, B))))),
% 0.12/0.37 inference(bind,[status(th)],[])).
% 0.12/0.37 tff(50,plain,
% 0.12/0.37 (![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B))) <=> ![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))),
% 0.12/0.37 inference(quant_intro,[status(thm)],[49])).
% 0.12/0.37 tff(51,plain,
% 0.12/0.37 (![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B))) <=> ![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(52,plain,
% 0.12/0.37 (^[B: $i, A: $i] : rewrite((((~divides(A, B)) | less(A, B)) | equalish(A, B)) <=> (equalish(A, B) | less(A, B) | (~divides(A, B))))),
% 0.12/0.37 inference(bind,[status(th)],[])).
% 0.12/0.37 tff(53,plain,
% 0.12/0.37 (![B: $i, A: $i] : (((~divides(A, B)) | less(A, B)) | equalish(A, B)) <=> ![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))),
% 0.12/0.37 inference(quant_intro,[status(thm)],[52])).
% 0.12/0.37 tff(54,axiom,(![B: $i, A: $i] : (((~divides(A, B)) | less(A, B)) | equalish(A, B))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-2.ax','divides_only_less_or_equal')).
% 0.12/0.37 tff(55,plain,
% 0.12/0.37 (![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[54, 53])).
% 0.12/0.37 tff(56,plain,
% 0.12/0.37 (![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[55, 51])).
% 0.12/0.37 tff(57,plain,(
% 0.12/0.37 ![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))),
% 0.12/0.37 inference(skolemize,[status(sab)],[56])).
% 0.12/0.37 tff(58,plain,
% 0.12/0.37 (![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[57, 50])).
% 0.12/0.37 tff(59,plain,
% 0.12/0.37 (((~![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))) | (equalish(b, d) | less(b, d) | (~divides(b, d)))) <=> ((~![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))) | equalish(b, d) | less(b, d) | (~divides(b, d)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(60,plain,
% 0.12/0.37 ((~![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))) | (equalish(b, d) | less(b, d) | (~divides(b, d)))),
% 0.12/0.37 inference(quant_inst,[status(thm)],[])).
% 0.12/0.37 tff(61,plain,
% 0.12/0.37 ((~![B: $i, A: $i] : (equalish(A, B) | less(A, B) | (~divides(A, B)))) | equalish(b, d) | less(b, d) | (~divides(b, d))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[60, 59])).
% 0.12/0.37 tff(62,plain,
% 0.12/0.37 (equalish(b, d) | less(b, d)),
% 0.12/0.37 inference(unit_resolution,[status(thm)],[61, 58, 48])).
% 0.12/0.37 tff(63,plain,
% 0.12/0.37 (less(b, d)),
% 0.12/0.37 inference(unit_resolution,[status(thm)],[62, 45])).
% 0.12/0.37 tff(64,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B))) <=> ![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(65,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B))) <=> ![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(66,plain,
% 0.12/0.37 (^[B: $i, A: $i, C: $i] : trans(monotonicity(rewrite(((~less(A, B)) | (~less(C, A))) <=> ((~less(C, A)) | (~less(A, B)))), ((((~less(A, B)) | (~less(C, A))) | less(C, B)) <=> (((~less(C, A)) | (~less(A, B))) | less(C, B)))), rewrite((((~less(C, A)) | (~less(A, B))) | less(C, B)) <=> (less(C, B) | (~less(C, A)) | (~less(A, B)))), ((((~less(A, B)) | (~less(C, A))) | less(C, B)) <=> (less(C, B) | (~less(C, A)) | (~less(A, B)))))),
% 0.12/0.37 inference(bind,[status(th)],[])).
% 0.12/0.37 tff(67,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : (((~less(A, B)) | (~less(C, A))) | less(C, B)) <=> ![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))),
% 0.12/0.37 inference(quant_intro,[status(thm)],[66])).
% 0.12/0.37 tff(68,axiom,(![B: $i, A: $i, C: $i] : (((~less(A, B)) | (~less(C, A))) | less(C, B))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax','transitivity_of_less')).
% 0.12/0.37 tff(69,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[68, 67])).
% 0.12/0.37 tff(70,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[69, 65])).
% 0.12/0.37 tff(71,plain,(
% 0.12/0.37 ![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))),
% 0.12/0.37 inference(skolemize,[status(sab)],[70])).
% 0.12/0.37 tff(72,plain,
% 0.12/0.37 (![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[71, 64])).
% 0.12/0.37 tff(73,plain,
% 0.12/0.37 (((~![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))) | (less(a, d) | (~less(a, b)) | (~less(b, d)))) <=> ((~![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))) | less(a, d) | (~less(a, b)) | (~less(b, d)))),
% 0.12/0.37 inference(rewrite,[status(thm)],[])).
% 0.12/0.37 tff(74,plain,
% 0.12/0.37 ((~![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))) | (less(a, d) | (~less(a, b)) | (~less(b, d)))),
% 0.12/0.37 inference(quant_inst,[status(thm)],[])).
% 0.12/0.37 tff(75,plain,
% 0.12/0.37 ((~![B: $i, A: $i, C: $i] : (less(C, B) | (~less(C, A)) | (~less(A, B)))) | less(a, d) | (~less(a, b)) | (~less(b, d))),
% 0.12/0.37 inference(modus_ponens,[status(thm)],[74, 73])).
% 0.12/0.37 tff(76,plain,
% 0.12/0.37 ($false),
% 0.12/0.37 inference(unit_resolution,[status(thm)],[75, 72, 20, 4, 63])).
% 0.12/0.37 % SZS output end Proof
% 0.12/0.37 % E exiting
%------------------------------------------------------------------------------