TSTP Solution File: SEU933^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU933^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.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 : Tue May 21 03:40:29 EDT 2024
% Result : Theorem 20.68s 5.69s
% Output : Refutation 20.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SEU933^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % Command : run_Leo-III %s %d
% 0.13/0.31 % Computer : n025.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 300
% 0.13/0.31 % DateTime : Sun May 19 17:05:24 EDT 2024
% 0.13/0.31 % CPUTime :
% 0.91/0.81 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.99/0.91 % [INFO] Parsing done (95ms).
% 0.99/0.91 % [INFO] Running in sequential loop mode.
% 1.51/1.11 % [INFO] eprover registered as external prover.
% 1.51/1.11 % [INFO] cvc4 registered as external prover.
% 1.51/1.12 % [INFO] Scanning for conjecture ...
% 1.73/1.17 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.73/1.19 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.73/1.19 % [INFO] Problem is higher-order (TPTP THF).
% 1.73/1.19 % [INFO] Type checking passed.
% 1.73/1.19 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 20.68/5.68 % External prover 'e' found a proof!
% 20.68/5.69 % [INFO] Killing All external provers ...
% 20.68/5.69 % Time passed: 5213ms (effective reasoning time: 4770ms)
% 20.68/5.69 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 20.68/5.69 % Axioms used in derivation (0):
% 20.68/5.69 % No. of inferences in proof: 83
% 20.68/5.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 5213 ms resp. 4770 ms w/o parsing
% 20.91/5.74 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.91/5.74 thf(b_type, type, b: $i).
% 20.91/5.74 thf(a_type, type, a: $i).
% 20.91/5.74 thf(sk1_type, type, sk1: (($i > $i) > (($i > $i) > $o))).
% 20.91/5.74 thf(sk2_type, type, sk2: (($i > $i) > (($i > $i) > (($i > $i) > $o)))).
% 20.91/5.74 thf(sk3_type, type, sk3: ((($i > $i) > $o) > (($i > $i) > (($i > $i) > ($i > $i))))).
% 20.91/5.74 thf(sk7_type, type, sk7: $i).
% 20.91/5.74 thf(sk9_type, type, sk9: $i).
% 20.91/5.74 thf(sk11_type, type, sk11: $i).
% 20.91/5.74 thf(sk13_type, type, sk13: $i).
% 20.91/5.74 thf(1,conjecture,(((a != b) => (~ (! [A:($i > $i),B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ A) & ! [D:($i > $i)]: ((C @ D) => (C @ (^ [E:$i]: (A @ (D @ E)))))) => (C @ (^ [D:$i]: (B @ (A @ D)))))) => (! [C:(($i > $i) > $o)]: (((C @ A) & ! [D:($i > $i)]: ((C @ D) => (C @ (^ [E:$i]: (A @ (D @ E)))))) => (C @ B)))))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM196B_pme)).
% 20.91/5.74 thf(2,negated_conjecture,((~ ((a != b) => (~ (! [A:($i > $i),B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ A) & ! [D:($i > $i)]: ((C @ D) => (C @ (^ [E:$i]: (A @ (D @ E)))))) => (C @ (^ [D:$i]: (B @ (A @ D)))))) => (! [C:(($i > $i) > $o)]: (((C @ A) & ! [D:($i > $i)]: ((C @ D) => (C @ (^ [E:$i]: (A @ (D @ E)))))) => (C @ B))))))))),inference(neg_conjecture,[status(cth)],[1])).
% 20.91/5.74 thf(3,plain,((~ ((~ (a = b)) => (~ (! [A:($i > $i),B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ (A)) & ! [D:($i > $i)]: ((C @ (D)) => (C @ (^ [E:$i]: (A @ (D @ E)))))) => (C @ (^ [D:$i]: (B @ (A @ D)))))) => (! [C:(($i > $i) > $o)]: (((C @ (A)) & ! [D:($i > $i)]: ((C @ (D)) => (C @ (^ [E:$i]: (A @ (D @ E)))))) => (C @ (B)))))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
% 20.91/5.74 thf(4,plain,(! [B:($i > $i),A:($i > $i)] : ((sk2 @ (B) @ (A) @ (A)) | (sk1 @ A @ B))),inference(cnf,[status(esa)],[3])).
% 20.91/5.74 thf(9,plain,(! [B:($i > $i),A:($i > $i)] : ((~ (sk2 @ (B) @ (A) @ (^ [C:$i]: (B @ (A @ C))))) | (sk1 @ A @ B))),inference(cnf,[status(esa)],[3])).
% 20.91/5.74 thf(19,plain,(! [D:($i > $i),C:($i > $i),B:($i > $i),A:($i > $i)] : ((sk1 @ (A) @ (B)) | (sk1 @ (C) @ (D)) | ((sk2 @ (B) @ (A) @ (A)) != (sk2 @ (D) @ (C) @ (^ [E:$i]: (D @ (C @ E))))))),inference(paramod_ordered,[status(thm)],[4,9])).
% 20.91/5.74 thf(20,plain,(! [B:($i > $i),A:($i > $i)] : ((sk1 @ (A) @ (B)) | (sk1 @ (A) @ (B)) | ((A) != (^ [C:$i]: (B @ (A @ C)))))),inference(pre_uni,[status(thm)],[19:[bind(A, $thf(C)),bind(B, $thf(D))]])).
% 20.91/5.74 thf(21,plain,(! [B:($i > $i),A:($i > $i)] : ((sk1 @ (A) @ (B)) | (sk1 @ (A) @ (B)) | ((A) != (^ [C:$i]: (B @ (A @ C)))))),inference(pre_uni,[status(thm)],[20:[]])).
% 20.91/5.74 thf(22,plain,(! [B:($i > $i),A:($i > $i)] : ((sk1 @ (A) @ (B)) | ((A) != (^ [C:$i]: (B @ (A @ C)))))),inference(simp,[status(thm)],[21])).
% 20.91/5.74 thf(8,plain,(! [C:(($i > $i) > $o),B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ (C @ (A))) | (C @ (sk3 @ (C) @ B @ A)) | (C @ (B)))),inference(cnf,[status(esa)],[3])).
% 20.91/5.74 thf(11,plain,(! [B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ ((A) = (A))) | ((A) = (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A)) | ((A) = (B)))),inference(replace_leibeq,[status(thm)],[8:[bind(A, $thf(@)),bind(B, $thf(A)),bind(C, $thf((=) @ ($i > $i) @ @))]])).
% 20.91/5.74 thf(16,plain,(! [B:($i > $i),A:($i > $i)] : (((A) != (A)) | ((A) = (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A)) | ((A) = (B)) | (~ (sk1 @ A @ B)))),inference(lifteq,[status(thm)],[11])).
% 20.91/5.74 thf(17,plain,(! [B:($i > $i),A:($i > $i)] : (((A) = (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A)) | ((A) = (B)) | (~ (sk1 @ A @ B)))),inference(simp,[status(thm)],[16])).
% 20.91/5.74 thf(5,plain,(! [C:(($i > $i) > $o),B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ (C @ (A))) | (~ (C @ (^ [D:$i]: (A @ (sk3 @ C @ B @ A @ D))))) | (C @ (B)))),inference(cnf,[status(esa)],[3])).
% 20.91/5.74 thf(12,plain,(! [C:(($i > $i) > $o),B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ (C @ (A))) | (~ (C @ (^ [D:$i]: (A @ (sk3 @ C @ B @ A @ D))))) | (C @ (B)))),inference(simp,[status(thm)],[5])).
% 20.91/5.74 thf(209,plain,(! [E:(($i > $i) > $o),D:($i > $i),C:($i > $i),B:($i > $i),A:($i > $i)] : (((A) = (B)) | (~ (sk1 @ (A) @ (B))) | (~ (sk1 @ (C) @ (D))) | (~ (E @ (C))) | (~ (E @ (A))) | (E @ (D)) | ((sk3 @ ((=) @ ($i > $i) @ A) @ B @ A) != (^ [F:$i]: (C @ (sk3 @ E @ D @ C @ F)))))),inference(paramod_ordered,[status(thm)],[17,12])).
% 20.91/5.74 thf(253,plain,(! [B:($i > $i),A:($i > $i)] : (((^ [C:$i]: (C)) = (A)) | (~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | (~ (sk1 @ (^ [C:$i]: (C)) @ (B))) | (~ ((^ [C:$i]: (C)) = (^ [C:$i]: (C)))) | (~ ((^ [C:$i]: (C)) = (^ [C:$i]: (C)))) | ((^ [C:$i]: (C)) = (B)) | ((^ [C:$i]: (A)) != (^ [C:$i]: (B))))),inference(pre_uni,[status(thm)],[209:[bind(A, $thf(^ [F:$i]: (F))),bind(B, $thf(B)),bind(C, $thf(^ [F:$i]: (F))),bind(D, $thf(D)),bind(E, $thf((=) @ ($i > $i) @ (^ [F:$i]: (F))))]])).
% 20.91/5.74 thf(254,plain,(! [A:($i > $i)] : (((^ [B:$i]: (B)) = (A)) | (~ ((^ [B:$i]: (B)) = (^ [B:$i]: (B)))) | (~ ((^ [B:$i]: (B)) = (^ [B:$i]: (B)))) | (~ (sk1 @ (^ [B:$i]: (B)) @ (A))) | (~ (sk1 @ (^ [B:$i]: (B)) @ (A))) | ((^ [B:$i]: (B)) = (A)))),inference(pattern_uni,[status(thm)],[253:[bind(A, $thf(@)),bind(B, $thf(@))]])).
% 20.91/5.74 thf(281,plain,(! [A:($i > $i)] : (((^ [B:$i]: (B)) = (A)) | ((^ [B:$i]: (B)) != (^ [B:$i]: (B))) | ((^ [B:$i]: (B)) != (^ [B:$i]: (B))) | (~ (sk1 @ (^ [B:$i]: (B)) @ (A))) | (~ (sk1 @ (^ [B:$i]: (B)) @ (A))) | ((^ [B:$i]: (B)) = (A)))),inference(lifteq,[status(thm)],[254])).
% 20.91/5.74 thf(282,plain,(! [A:($i > $i)] : (((^ [B:$i]: (B)) = (A)) | (~ (sk1 @ (^ [B:$i]: (B)) @ (A))))),inference(simp,[status(thm)],[281])).
% 20.91/5.74 thf(283,plain,(! [B:$i,A:($i > $i)] : (((A @ B) = B) | (~ (sk1 @ (^ [C:$i]: (C)) @ (A))))),inference(func_ext,[status(esa)],[282])).
% 20.91/5.74 thf(7,plain,((~ (a = b))),inference(cnf,[status(esa)],[3])).
% 20.91/5.74 thf(15,plain,((a != b)),inference(lifteq,[status(thm)],[7])).
% 20.91/5.74 thf(754,plain,(! [B:$i,A:($i > $i)] : ((~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | (B != b) | ((A @ B) != a))),inference(paramod_ordered,[status(thm)],[283,15])).
% 20.91/5.74 thf(774,plain,(! [A:$i] : ((~ (sk1 @ (^ [B:$i]: (B)) @ (^ [B:$i]: (a)))) | (A != b))),inference(pre_uni,[status(thm)],[754:[bind(A, $thf(^ [C:$i]: (a)))]])).
% 20.91/5.74 thf(776,plain,((~ (sk1 @ (^ [A:$i]: (A)) @ (^ [A:$i]: (a))))),inference(pattern_uni,[status(thm)],[774:[bind(A, $thf(b))]])).
% 20.91/5.74 thf(796,plain,(! [B:($i > $i),A:($i > $i)] : (((A) != (^ [C:$i]: (B @ (A @ C)))) | ((sk1 @ (A) @ (B)) != (sk1 @ (^ [C:$i]: (C)) @ (^ [C:$i]: (a)))))),inference(paramod_ordered,[status(thm)],[22,776])).
% 20.91/5.74 thf(797,plain,(((^ [A:$i]: (A)) != (^ [A:$i]: (a)))),inference(pattern_uni,[status(thm)],[796:[bind(A, $thf(^ [C:$i]: (C))),bind(B, $thf(^ [C:$i]: (a)))]])).
% 20.91/5.74 thf(826,plain,((sk7 != a)),inference(func_ext,[status(esa)],[797])).
% 20.91/5.74 thf(857,plain,(! [B:$i,A:($i > $i)] : ((~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | (B != a) | ((A @ B) != sk7))),inference(paramod_ordered,[status(thm)],[283,826])).
% 20.91/5.74 thf(858,plain,(! [A:$i] : ((~ (sk1 @ (^ [B:$i]: (B)) @ (^ [B:$i]: (sk7)))) | (A != a))),inference(pre_uni,[status(thm)],[857:[bind(A, $thf(^ [C:$i]: (sk7)))]])).
% 20.91/5.74 thf(860,plain,((~ (sk1 @ (^ [A:$i]: (A)) @ (^ [A:$i]: (sk7))))),inference(pattern_uni,[status(thm)],[858:[bind(A, $thf(a))]])).
% 20.91/5.74 thf(956,plain,(! [B:($i > $i),A:($i > $i)] : (((A) != (^ [C:$i]: (B @ (A @ C)))) | ((sk1 @ (A) @ (B)) != (sk1 @ (^ [C:$i]: (C)) @ (^ [C:$i]: (sk7)))))),inference(paramod_ordered,[status(thm)],[22,860])).
% 20.91/5.74 thf(957,plain,(((^ [A:$i]: (A)) != (^ [A:$i]: (sk7)))),inference(pattern_uni,[status(thm)],[956:[bind(A, $thf(^ [C:$i]: (C))),bind(B, $thf(^ [C:$i]: (sk7)))]])).
% 20.91/5.75 thf(977,plain,((sk9 != sk7)),inference(func_ext,[status(esa)],[957])).
% 20.91/5.75 thf(1008,plain,(! [B:$i,A:($i > $i)] : ((~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | (B != sk7) | ((A @ B) != sk9))),inference(paramod_ordered,[status(thm)],[283,977])).
% 20.91/5.75 thf(1009,plain,(! [A:$i] : ((~ (sk1 @ (^ [B:$i]: (B)) @ (^ [B:$i]: (sk9)))) | (A != sk7))),inference(pre_uni,[status(thm)],[1008:[bind(A, $thf(^ [C:$i]: (sk9)))]])).
% 20.91/5.75 thf(1011,plain,((~ (sk1 @ (^ [A:$i]: (A)) @ (^ [A:$i]: (sk9))))),inference(pattern_uni,[status(thm)],[1009:[bind(A, $thf(sk7))]])).
% 20.91/5.75 thf(1453,plain,(! [B:($i > $i),A:($i > $i)] : (((A) != (^ [C:$i]: (B @ (A @ C)))) | ((sk1 @ (A) @ (B)) != (sk1 @ (^ [C:$i]: (C)) @ (^ [C:$i]: (sk9)))))),inference(paramod_ordered,[status(thm)],[22,1011])).
% 20.91/5.75 thf(1454,plain,(((^ [A:$i]: (A)) != (^ [A:$i]: (sk9)))),inference(pattern_uni,[status(thm)],[1453:[bind(A, $thf(^ [C:$i]: (C))),bind(B, $thf(^ [C:$i]: (sk9)))]])).
% 20.91/5.75 thf(10,plain,(! [B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ ((A) = (A))) | (~ ((A) = (^ [C:$i]: (A @ (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A @ C))))) | ((A) = (B)))),inference(replace_leibeq,[status(thm)],[5:[bind(A, $thf(@)),bind(B, $thf(A)),bind(C, $thf((=) @ ($i > $i) @ @))]])).
% 20.91/5.75 thf(13,plain,(! [B:($i > $i),A:($i > $i)] : (((A) != (A)) | ((^ [C:$i]: (A @ (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A @ C))) != (A)) | ((A) = (B)) | (~ (sk1 @ A @ B)))),inference(lifteq,[status(thm)],[10])).
% 20.91/5.75 thf(14,plain,(! [B:($i > $i),A:($i > $i)] : (((^ [C:$i]: (A @ (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A @ C))) != (A)) | ((A) = (B)) | (~ (sk1 @ A @ B)))),inference(simp,[status(thm)],[13])).
% 20.91/5.75 thf(25,plain,(! [E:(($i > $i) > $o),D:($i > $i),C:($i > $i),B:($i > $i),A:($i > $i)] : ((~ (sk2 @ (B) @ (A) @ (^ [F:$i]: (B @ (A @ F))))) | (~ (E @ (C))) | (~ (E @ (^ [F:$i]: (C @ (sk3 @ E @ D @ C @ F))))) | (E @ (D)) | ((sk1 @ (A) @ (B)) != (sk1 @ (C) @ (D))))),inference(paramod_ordered,[status(thm)],[9,12])).
% 20.91/5.75 thf(26,plain,(! [C:(($i > $i) > $o),B:($i > $i),A:($i > $i)] : ((~ (sk2 @ (B) @ (A) @ (^ [D:$i]: (B @ (A @ D))))) | (~ (C @ (A))) | (~ (C @ (^ [D:$i]: (A @ (sk3 @ C @ B @ A @ D))))) | (C @ (B)))),inference(pattern_uni,[status(thm)],[25:[bind(A, $thf(A)),bind(B, $thf(B)),bind(C, $thf(A)),bind(D, $thf(B))]])).
% 20.91/5.75 thf(59,plain,(! [B:($i > $i),A:($i > $i)] : ((~ (sk2 @ (B) @ (A) @ (^ [C:$i]: (B @ (A @ C))))) | (~ ((A) = (A))) | (~ ((A) = (^ [C:$i]: (A @ (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A @ C))))) | ((A) = (B)))),inference(replace_leibeq,[status(thm)],[26:[bind(A, $thf(?)),bind(B, $thf(@)),bind(C, $thf((=) @ ($i > $i) @ ?))]])).
% 20.91/5.75 thf(69,plain,(! [B:($i > $i),A:($i > $i)] : (((A) != (A)) | ((^ [C:$i]: (A @ (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A @ C))) != (A)) | ((A) = (B)) | (~ (sk2 @ (B) @ (A) @ (^ [C:$i]: (B @ (A @ C))))))),inference(lifteq,[status(thm)],[59])).
% 20.91/5.75 thf(74,plain,(! [B:($i > $i),A:($i > $i)] : ((~ (sk2 @ (B) @ (A) @ (^ [C:$i]: (B @ (A @ C))))) | ((A) = (B)) | ((^ [C:$i]: (A @ (sk3 @ ((=) @ ($i > $i) @ A) @ B @ A @ C))) != (A)))),inference(pre_uni,[status(thm)],[69:[]])).
% 20.91/5.75 thf(999,plain,(! [B:$i,A:($i > $i)] : ((~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | ((^ [C:$i]: (B)) != (^ [C:$i]: (C))) | ((A @ B) != sk7))),inference(paramod_ordered,[status(thm)],[283,957])).
% 20.91/5.75 thf(1002,plain,((~ (sk1 @ (^ [A:$i]: (A)) @ (^ [A:$i]: (A)))) | ((^ [A:$i]: (sk7)) != (^ [A:$i]: (A)))),inference(pre_uni,[status(thm)],[999:[bind(A, $thf(^ [C:$i]: (C))),bind(B, $thf(sk7))]])).
% 20.91/5.75 thf(1479,plain,((sk11 != sk9)),inference(func_ext,[status(esa)],[1454])).
% 20.91/5.75 thf(1510,plain,(! [B:$i,A:($i > $i)] : ((~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | (B != sk9) | ((A @ B) != sk11))),inference(paramod_ordered,[status(thm)],[283,1479])).
% 20.91/5.75 thf(1511,plain,(! [A:$i] : ((~ (sk1 @ (^ [B:$i]: (B)) @ (^ [B:$i]: (sk11)))) | (A != sk9))),inference(pre_uni,[status(thm)],[1510:[bind(A, $thf(^ [C:$i]: (sk11)))]])).
% 20.91/5.75 thf(1513,plain,((~ (sk1 @ (^ [A:$i]: (A)) @ (^ [A:$i]: (sk11))))),inference(pattern_uni,[status(thm)],[1511:[bind(A, $thf(sk9))]])).
% 20.91/5.75 thf(295,plain,(! [C:($i > $i),B:($i > $i),A:($i > $i)] : ((~ (sk2 @ (B) @ (A) @ (^ [D:$i]: (B @ (A @ D))))) | ((^ [D:$i]: (D)) = (C)) | ((sk1 @ (A) @ (B)) != (sk1 @ (^ [D:$i]: (D)) @ (C))))),inference(paramod_ordered,[status(thm)],[9,282])).
% 20.91/5.75 thf(296,plain,(! [A:($i > $i)] : ((~ (sk2 @ (A) @ (^ [B:$i]: (B)) @ (A))) | ((^ [B:$i]: (B)) = (A)))),inference(pattern_uni,[status(thm)],[295:[bind(A, $thf(^ [D:$i]: (D))),bind(B, $thf(B)),bind(C, $thf(B))]])).
% 20.91/5.75 thf(384,plain,(! [A:($i > $i)] : ((~ (sk2 @ (A) @ (^ [B:$i]: (B)) @ (A))) | ((^ [B:$i]: (B)) = (A)))),inference(simp,[status(thm)],[296])).
% 20.91/5.75 thf(312,plain,(! [C:($i > $i),B:($i > $i),A:($i > $i)] : ((sk2 @ (B) @ (A) @ (A)) | ((^ [D:$i]: (D)) = (C)) | ((sk1 @ (A) @ (B)) != (sk1 @ (^ [D:$i]: (D)) @ (C))))),inference(paramod_ordered,[status(thm)],[4,282])).
% 20.91/5.75 thf(313,plain,(! [A:($i > $i)] : ((sk2 @ (A) @ (^ [B:$i]: (B)) @ (^ [B:$i]: (B))) | ((^ [B:$i]: (B)) = (A)))),inference(pattern_uni,[status(thm)],[312:[bind(A, $thf(^ [D:$i]: (D))),bind(B, $thf(B)),bind(C, $thf(B))]])).
% 20.91/5.75 thf(388,plain,(! [A:($i > $i)] : ((sk2 @ (A) @ (^ [B:$i]: (B)) @ (^ [B:$i]: (B))) | ((^ [B:$i]: (B)) = (A)))),inference(simp,[status(thm)],[313])).
% 20.91/5.75 thf(840,plain,(! [A:($i > $i)] : ((sk2 @ (A) @ (^ [B:$i]: (B)) @ (^ [B:$i]: (B))) | ((A) != (^ [B:$i]: (a))))),inference(paramod_ordered,[status(thm)],[388,797])).
% 20.91/5.75 thf(841,plain,((sk2 @ (^ [A:$i]: (a)) @ (^ [A:$i]: (A)) @ (^ [A:$i]: (A)))),inference(pattern_uni,[status(thm)],[840:[bind(A, $thf(^ [B:$i]: (a)))]])).
% 20.91/5.75 thf(24,plain,(! [B:($i > $i),A:($i > $i)] : (((B @ (A @ (sk4 @ B @ A))) != (A @ (sk4 @ B @ A))) | (sk1 @ (A) @ (B)))),inference(func_ext,[status(esa)],[22])).
% 20.91/5.75 thf(1493,plain,(! [A:($i > $i)] : ((sk2 @ (A) @ (^ [B:$i]: (B)) @ (^ [B:$i]: (B))) | ((A) != (^ [B:$i]: (sk9))))),inference(paramod_ordered,[status(thm)],[388,1454])).
% 20.91/5.75 thf(1494,plain,((sk2 @ (^ [A:$i]: (sk9)) @ (^ [A:$i]: (A)) @ (^ [A:$i]: (A)))),inference(pattern_uni,[status(thm)],[1493:[bind(A, $thf(^ [B:$i]: (sk9)))]])).
% 20.91/5.75 thf(1737,plain,(! [B:($i > $i),A:($i > $i)] : (((A) != (^ [C:$i]: (B @ (A @ C)))) | ((sk1 @ (A) @ (B)) != (sk1 @ (^ [C:$i]: (C)) @ (^ [C:$i]: (sk11)))))),inference(paramod_ordered,[status(thm)],[22,1513])).
% 20.91/5.75 thf(1738,plain,(((^ [A:$i]: (A)) != (^ [A:$i]: (sk11)))),inference(pattern_uni,[status(thm)],[1737:[bind(A, $thf(^ [C:$i]: (C))),bind(B, $thf(^ [C:$i]: (sk11)))]])).
% 20.91/5.75 thf(1777,plain,(! [A:($i > $i)] : ((sk2 @ (A) @ (^ [B:$i]: (B)) @ (^ [B:$i]: (B))) | ((A) != (^ [B:$i]: (sk11))))),inference(paramod_ordered,[status(thm)],[388,1738])).
% 20.91/5.75 thf(1778,plain,((sk2 @ (^ [A:$i]: (sk11)) @ (^ [A:$i]: (A)) @ (^ [A:$i]: (A)))),inference(pattern_uni,[status(thm)],[1777:[bind(A, $thf(^ [B:$i]: (sk11)))]])).
% 20.91/5.75 thf(6,plain,(! [C:($i > $i),B:($i > $i),A:($i > $i)] : ((~ (sk2 @ (B) @ (A) @ (C))) | (sk2 @ (B) @ (A) @ (^ [D:$i]: (A @ (C @ D)))) | (sk1 @ A @ B))),inference(cnf,[status(esa)],[3])).
% 20.91/5.75 thf(40,plain,(! [C:(($i > $i) > $o),B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ (C @ (A))) | (C @ (B)) | ((C @ (^ [D:$i]: (A @ (sk3 @ C @ B @ A @ D)))) != (sk1 @ A @ B)) | ~ (($true)))),inference(eqfactor_ordered,[status(thm)],[12])).
% 20.91/5.75 thf(97,plain,(! [D:(($i > $i) > ($i > $i)),C:(($i > $i) > ($i > $i)),B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ (sk1 @ (C @ A) @ (D @ A))) | (sk1 @ (C @ B) @ (D @ B)) | ((D @ (^ [E:$i]: (A @ (sk3 @ (^ [F:($i > $i)]: (sk1 @ (C @ F) @ (D @ F))) @ B @ A @ E)))) != (B)) | ((C @ (^ [E:$i]: (A @ (sk3 @ (^ [F:($i > $i)]: (sk1 @ (C @ F) @ (D @ F))) @ B @ A @ E)))) != (A)))),inference(pre_uni,[status(thm)],[40:[bind(A, $thf(A)),bind(B, $thf(B)),bind(C, $thf(^ [F:($i > $i)]: (sk1 @ (D @ F) @ (E @ F))))]])).
% 20.91/5.75 thf(98,plain,(! [D:(($i > $i) > ($i > $i)),C:(($i > $i) > ($i > $i)),B:($i > $i),A:($i > $i)] : ((sk1 @ (C @ B) @ (D @ B)) | (~ (sk1 @ (C @ A) @ (D @ A))) | (~ (sk1 @ A @ B)) | ((D @ (^ [E:$i]: (A @ (sk3 @ (^ [F:($i > $i)]: (sk1 @ (C @ F) @ (D @ F))) @ B @ A @ E)))) != (B)) | ((C @ (^ [E:$i]: (A @ (sk3 @ (^ [F:($i > $i)]: (sk1 @ (C @ F) @ (D @ F))) @ B @ A @ E)))) != (A)))),inference(pre_uni,[status(thm)],[97:[]])).
% 20.91/5.75 thf(117,plain,(! [D:(($i > $i) > ($i > $i)),C:(($i > $i) > ($i > $i)),B:($i > $i),A:($i > $i)] : ((sk1 @ (C @ B) @ (D @ B)) | (~ (sk1 @ (C @ A) @ (D @ A))) | (~ (sk1 @ A @ B)) | ((D @ (^ [E:$i]: (A @ (sk3 @ (^ [F:($i > $i)]: (sk1 @ (C @ F) @ (D @ F))) @ B @ A @ E)))) != (B)) | ((C @ (^ [E:$i]: (A @ (sk3 @ (^ [F:($i > $i)]: (sk1 @ (C @ F) @ (D @ F))) @ B @ A @ E)))) != (A)))),inference(simp,[status(thm)],[98])).
% 20.91/5.75 thf(1501,plain,(! [B:$i,A:($i > $i)] : ((~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | ((^ [C:$i]: (B)) != (^ [C:$i]: (C))) | ((A @ B) != sk9))),inference(paramod_ordered,[status(thm)],[283,1454])).
% 20.91/5.75 thf(1503,plain,((~ (sk1 @ (^ [A:$i]: (A)) @ (^ [A:$i]: (A)))) | ((^ [A:$i]: (sk9)) != (^ [A:$i]: (A)))),inference(pre_uni,[status(thm)],[1501:[bind(A, $thf(^ [C:$i]: (C))),bind(B, $thf(sk9))]])).
% 20.91/5.75 thf(18,plain,(! [C:(($i > $i) > $o),B:($i > $i),A:($i > $i)] : ((~ (sk1 @ A @ B)) | (~ (C @ (A))) | (C @ (sk3 @ (C) @ B @ A)) | (C @ (B)))),inference(simp,[status(thm)],[8])).
% 20.91/5.75 thf(1763,plain,((sk13 != sk11)),inference(func_ext,[status(esa)],[1738])).
% 20.91/5.75 thf(991,plain,(! [A:($i > $i)] : ((sk2 @ (A) @ (^ [B:$i]: (B)) @ (^ [B:$i]: (B))) | ((A) != (^ [B:$i]: (sk7))))),inference(paramod_ordered,[status(thm)],[388,957])).
% 20.91/5.75 thf(992,plain,((sk2 @ (^ [A:$i]: (sk7)) @ (^ [A:$i]: (A)) @ (^ [A:$i]: (A)))),inference(pattern_uni,[status(thm)],[991:[bind(A, $thf(^ [B:$i]: (sk7)))]])).
% 20.91/5.75 thf(848,plain,(! [B:$i,A:($i > $i)] : ((~ (sk1 @ (^ [C:$i]: (C)) @ (A))) | ((^ [C:$i]: (B)) != (^ [C:$i]: (C))) | ((A @ B) != a))),inference(paramod_ordered,[status(thm)],[283,797])).
% 20.91/5.75 thf(850,plain,((~ (sk1 @ (^ [A:$i]: (A)) @ (^ [A:$i]: (A)))) | ((^ [A:$i]: (a)) != (^ [A:$i]: (A)))),inference(pre_uni,[status(thm)],[848:[bind(A, $thf(^ [C:$i]: (C))),bind(B, $thf(a))]])).
% 20.91/5.75 thf(2250,plain,(($false)),inference(e,[status(thm)],[1454,977,14,74,957,1002,17,1011,3,1513,384,797,841,24,1479,1494,1778,6,117,9,388,22,826,1503,12,776,18,282,1763,1738,4,283,860,992,15,850])).
% 20.91/5.75 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.91/5.75 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------