TSTP Solution File: SEV195^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV195^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n028.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 : Mon Jun 24 15:59:43 EDT 2024
% Result : Theorem 236.76s 42.20s
% Output : Refutation 236.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEV195^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_Leo-III %s %d SAT
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 18:29:55 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.90/0.89 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/1.02 % [INFO] Parsing done (126ms).
% 1.19/1.03 % [INFO] Running in sequential loop mode.
% 1.65/1.37 % [INFO] nitpick registered as external prover.
% 1.65/1.38 % [INFO] Scanning for conjecture ...
% 1.79/1.45 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.96/1.48 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.96/1.48 % [INFO] Problem is higher-order (TPTP THF).
% 1.96/1.49 % [INFO] Type checking passed.
% 1.96/1.49 % [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 ...
% 236.76/42.20 % [INFO] Killing All external provers ...
% 236.76/42.20 % Time passed: 41697ms (effective reasoning time: 41164ms)
% 236.76/42.20 % 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)>
% 236.76/42.20 % Axioms used in derivation (0):
% 236.76/42.20 % No. of inferences in proof: 27
% 236.76/42.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 41697 ms resp. 41164 ms w/o parsing
% 236.76/42.23 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 236.76/42.23 thf(a_type, type, a: $tType).
% 236.76/42.23 thf(cP_type, type, cP: (a > (a > a))).
% 236.76/42.23 thf(cZ_type, type, cZ: a).
% 236.76/42.23 thf(sk1_type, type, sk1: ((a > $o) > a)).
% 236.76/42.23 thf(sk2_type, type, sk2: ((a > $o) > a)).
% 236.76/42.23 thf(sk3_type, type, sk3: a).
% 236.76/42.23 thf(1,conjecture,(((! [A:a,B:a]: ((cP @ A @ B) != cZ) & ! [A:a,B:a,C:a,D:a]: (((cP @ A @ C) = (cP @ B @ D)) => ((A = B) & (C = D))) & ! [A:(a > $o)]: (((A @ cZ) & ! [B:a,C:a]: (((A @ B) & (A @ C)) => (A @ (cP @ B @ C)))) => (! [B:a]: (A @ B)))) => (! [A:a]: ((A = cZ) | ? [B:a,C:a]: (A = (cP @ B @ C)))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_LEM1D_pme)).
% 236.76/42.23 thf(2,negated_conjecture,((~ ((! [A:a,B:a]: ((cP @ A @ B) != cZ) & ! [A:a,B:a,C:a,D:a]: (((cP @ A @ C) = (cP @ B @ D)) => ((A = B) & (C = D))) & ! [A:(a > $o)]: (((A @ cZ) & ! [B:a,C:a]: (((A @ B) & (A @ C)) => (A @ (cP @ B @ C)))) => (! [B:a]: (A @ B)))) => (! [A:a]: ((A = cZ) | ? [B:a,C:a]: (A = (cP @ B @ C))))))),inference(neg_conjecture,[status(cth)],[1])).
% 236.76/42.23 thf(3,plain,((~ ((! [A:a,B:a]: ~ ((cP @ A @ B) = cZ) & ! [A:a,B:a,C:a,D:a]: (((cP @ A @ C) = (cP @ B @ D)) => ((A = B) & (C = D))) & ! [A:(a > $o)]: (((A @ cZ) & ! [B:a,C:a]: (((A @ B) & (A @ C)) => (A @ (cP @ B @ C)))) => (! [B:a]: (A @ B)))) => (! [A:a]: ((A = cZ) | ? [B:a,C:a]: (A = (cP @ B @ C))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
% 236.76/42.23 thf(4,plain,((~ ((~ (? [A:a,B:a]: ((cP @ A @ B) = cZ)) & ! [A:a,B:a,C:a,D:a]: (((cP @ A @ C) = (cP @ B @ D)) => ((A = B) & (C = D))) & ! [A:(a > $o)]: (((A @ cZ) & ! [B:a,C:a]: (((A @ B) & (A @ C)) => (A @ (cP @ B @ C)))) => (! [B:a]: (A @ B)))) => (! [A:a]: ((A = cZ) | ? [B:a,C:a]: (A = (cP @ B @ C))))))),inference(miniscope,[status(thm)],[3])).
% 236.76/42.23 thf(8,plain,(! [B:a,A:(a > $o)] : ((~ (A @ cZ)) | (~ (A @ (cP @ (sk1 @ (A)) @ (sk2 @ (A))))) | (A @ B))),inference(cnf,[status(esa)],[4])).
% 236.76/42.23 thf(32,plain,(! [B:a,A:(a > $o)] : ((~ (A @ cZ)) | (~ (A @ (cP @ (sk1 @ (A)) @ (sk2 @ (A))))) | (A @ B))),inference(simp,[status(thm)],[8])).
% 236.76/42.23 thf(39,plain,(! [B:a,A:(a > $o)] : ((~ (A @ cZ)) | (~ (A @ (cP @ (sk1 @ (A)) @ (sk2 @ (A))))) | ((A @ B) != (~ (A @ cZ))) | ~ (($true)))),inference(eqfactor_ordered,[status(thm)],[32])).
% 236.76/42.23 thf(54,plain,(! [B:a,A:(a > $o)] : ((~ (A @ cZ)) | (~ (A @ (cP @ (sk1 @ (A)) @ (sk2 @ (A))))) | ((A @ B) != (~ (A @ cZ))))),inference(simp,[status(thm)],[39])).
% 236.76/42.23 thf(81,plain,(! [D:a,C:(a > $o),B:a,A:(a > $o)] : ((~ (A @ cZ)) | (~ (A @ (cP @ (sk1 @ (A)) @ (sk2 @ (A))))) | (~ (C @ cZ)) | (~ (C @ (cP @ (sk1 @ (C)) @ (sk2 @ (C))))) | (~ (C @ D)) | ((A @ B) != (~ (C @ cZ))))),inference(paramod_ordered,[status(thm)],[32,54])).
% 236.76/42.23 thf(102,plain,(! [D:(a > $o),C:a,B:(a > $o),A:a] : ((~ (~ (D @ cZ))) | (~ (~ (D @ (cP @ (sk1 @ (^ [E:a]: ~ (D @ E))) @ (sk2 @ (^ [E:a]: ~ (D @ E))))))) | (~ (B @ cZ)) | (~ (B @ (cP @ (sk1 @ (B)) @ (sk2 @ (B))))) | (~ (B @ C)) | ((D @ A) != (B @ cZ)))),inference(pre_uni,[status(thm)],[81:[bind(A, $thf(^ [F:a]: ~ (E @ F)))]])).
% 236.76/42.23 thf(103,plain,(! [D:(a > $o),C:a,B:(a > $o),A:a] : ((~ (B @ C)) | (~ (B @ (cP @ (sk1 @ (B)) @ (sk2 @ (B))))) | (~ (B @ cZ)) | (~ (~ (D @ (cP @ (sk1 @ (^ [E:a]: ~ (D @ E))) @ (sk2 @ (^ [E:a]: ~ (D @ E))))))) | (~ (~ (D @ cZ))) | ((D @ A) != (B @ cZ)))),inference(pre_uni,[status(thm)],[102:[]])).
% 236.76/42.23 thf(108,plain,(! [D:(a > $o),C:a,B:(a > $o),A:a] : (((D @ A) != (B @ cZ)) | (D @ cZ) | (D @ (cP @ (sk1 @ (^ [E:a]: ~ (D @ E))) @ (sk2 @ (^ [E:a]: ~ (D @ E))))) | (~ (B @ cZ)) | (~ (B @ (cP @ (sk1 @ (B)) @ (sk2 @ (B))))) | (~ (B @ C)))),inference(cnf,[status(esa)],[103])).
% 236.76/42.23 thf(109,plain,(! [D:(a > $o),C:a,B:(a > $o),A:a] : (((D @ A) != (B @ cZ)) | (D @ cZ) | (D @ (cP @ (sk1 @ (^ [E:a]: ~ (D @ E))) @ (sk2 @ (^ [E:a]: ~ (D @ E))))) | (~ (B @ cZ)) | (~ (B @ (cP @ (sk1 @ (B)) @ (sk2 @ (B))))) | (~ (B @ C)))),inference(simp,[status(thm)],[108])).
% 236.76/42.23 thf(21510,plain,(! [B:(a > $o),A:a] : ((~ (B @ A)) | (B @ cZ) | (B @ (cP @ (sk1 @ (^ [C:a]: ~ (B @ C))) @ (sk2 @ (^ [C:a]: ~ (B @ C))))) | ~ (($true)) | ~ (($true)) | ~ (($true)))),inference(prim_subst,[status(thm)],[109:[bind(A, $thf(A)),bind(B, $thf(^ [E:a]: (($true))))]])).
% 236.76/42.23 thf(21523,plain,(! [A:a] : ((~ (A = A)) | (A = cZ) | (A = (cP @ (sk1 @ (^ [B:a]: ~ (A = B))) @ (sk2 @ (^ [B:a]: ~ (A = B))))) | ~ (($true)) | ~ (($true)) | ~ (($true)))),inference(replace_leibeq,[status(thm)],[21510:[bind(A, $thf(?)),bind(B, $thf((=) @ a @ ?))]])).
% 236.76/42.23 thf(21595,plain,(! [A:a] : ((A != A) | (A = cZ) | (A = (cP @ (sk1 @ (^ [B:a]: ~ (A = B))) @ (sk2 @ (^ [B:a]: ~ (A = B))))) | ~ (($true)) | ~ (($true)) | ~ (($true)))),inference(lifteq,[status(thm)],[21523])).
% 236.76/42.23 thf(21639,plain,(! [A:a] : (~ (($true)) | ~ (($true)) | ~ (($true)) | (A = (cP @ (sk1 @ (^ [B:a]: ~ (A = B))) @ (sk2 @ (^ [B:a]: ~ (A = B))))) | (A = cZ))),inference(pattern_uni,[status(thm)],[21595:[]])).
% 236.76/42.23 thf(22070,plain,(! [A:a] : ((A = (cP @ (sk1 @ (^ [B:a]: ~ (A = B))) @ (sk2 @ (^ [B:a]: ~ (A = B))))) | (A = cZ))),inference(simp,[status(thm)],[21639])).
% 236.76/42.23 thf(7,plain,(! [B:a,A:a] : ((~ (sk3 = (cP @ A @ B))))),inference(cnf,[status(esa)],[4])).
% 236.76/42.23 thf(29,plain,(! [B:a,A:a] : (((cP @ A @ B) != sk3))),inference(lifteq,[status(thm)],[7])).
% 236.76/42.23 thf(30,plain,(! [B:a,A:a] : (((cP @ A @ B) != sk3))),inference(simp,[status(thm)],[29])).
% 236.76/42.23 thf(50242,plain,(! [C:a,B:a,A:a] : ((A = cZ) | (A != sk3) | ((cP @ (sk1 @ (^ [D:a]: ~ (A = D))) @ (sk2 @ (^ [D:a]: ~ (A = D)))) != (cP @ B @ C)))),inference(paramod_ordered,[status(thm)],[22070,30])).
% 236.76/42.23 thf(50243,plain,(! [A:a] : ((A = cZ) | (A != sk3))),inference(pattern_uni,[status(thm)],[50242:[bind(A, $thf(A)),bind(B, $thf(sk1 @ (^ [D:a]: ~ (A = D)))),bind(C, $thf(sk2 @ (^ [D:a]: ~ (A = D))))]])).
% 236.76/42.23 thf(50560,plain,((sk3 = cZ)),inference(simp,[status(thm)],[50243])).
% 236.76/42.23 thf(12,plain,((~ (sk3 = cZ))),inference(cnf,[status(esa)],[4])).
% 236.76/42.23 thf(28,plain,((sk3 != cZ)),inference(lifteq,[status(thm)],[12])).
% 236.76/42.23 thf(50824,plain,(($false)),inference(simplifyReflect,[status(thm)],[50560,28])).
% 236.76/42.23 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 236.76/42.23 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------