%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : PHI002^2 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:20:12 AM UTC 2026
% Result : Theorem 4.14s 2.39s
% Output : Refutation 4.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI002^2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.09/0.20 % Computer : n015.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 13:20:02 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.86/0.78 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/1.02 % [INFO] Parsing done (240ms).
% 1.51/1.04 % [INFO] Running in sequential loop mode.
% 2.10/1.44 % [INFO] eprover registered as external prover.
% 2.10/1.45 % [INFO] Scanning for conjecture ...
% 2.55/1.61 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.55/1.64 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.55/1.65 % [INFO] Problem is higher-order (TPTP THF).
% 2.55/1.66 % [INFO] Type checking passed.
% 2.55/1.66 % [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 ...
% 4.14/2.39 % External prover 'e' found a proof!
% 4.14/2.39 % [INFO] Killing All external provers ...
% 4.14/2.39 % Time passed: 2040ms (effective reasoning time: 1341ms)
% 4.14/2.39 % 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)>
% 4.14/2.39 % Axioms used in derivation (2): axA1, axA2
% 4.14/2.39 % No. of inferences in proof: 8
% 4.14/2.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2040 ms resp. 1341 ms w/o parsing
% 4.33/2.45 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.33/2.45 thf(mu_type, type, mu: $tType).
% 4.33/2.45 thf(mnot_decl, type, mnot: (($i > $o) > ($i > $o))).
% 4.33/2.45 thf(mand_decl, type, mand: (($i > $o) > (($i > $o) > ($i > $o)))).
% 4.33/2.45 thf(mimplies_decl, type, mimplies: (($i > $o) > (($i > $o) > ($i > $o)))).
% 4.33/2.45 thf(mequiv_decl, type, mequiv: (($i > $o) > (($i > $o) > ($i > $o)))).
% 4.33/2.45 thf(mforall_ind_decl, type, mforall_ind: ((mu > ($i > $o)) > ($i > $o))).
% 4.33/2.45 thf(mforall_indset_decl, type, mforall_indset: (((mu > ($i > $o)) > ($i > $o)) > ($i > $o))).
% 4.33/2.45 thf(mexists_ind_decl, type, mexists_ind: ((mu > ($i > $o)) > ($i > $o))).
% 4.33/2.45 thf(mbox_generic_decl, type, mbox_generic: (($i > ($i > $o)) > (($i > $o) > ($i > $o)))).
% 4.33/2.45 thf(mdia_generic_decl, type, mdia_generic: (($i > ($i > $o)) > (($i > $o) > ($i > $o)))).
% 4.33/2.45 thf(rel_decl, type, rel: ($i > ($i > $o))).
% 4.33/2.45 thf(mbox_decl, type, mbox: (($i > $o) > ($i > $o))).
% 4.33/2.45 thf(mdia_decl, type, mdia: (($i > $o) > ($i > $o))).
% 4.33/2.45 thf(mvalid_decl, type, mvalid: (($i > $o) > $o)).
% 4.33/2.45 thf(positive_decl, type, positive: ((mu > ($i > $o)) > ($i > $o))).
% 4.33/2.45 thf(mnot_def, definition, mnot = (^ [A:($i > $o),B:$i]: ~ (A @ B)) ).
% 4.33/2.45 thf(mand_def, definition, mand = (^ [A:($i > $o),B:($i > $o),C:$i]: ((A @ C) & (B @ C))) ).
% 4.33/2.45 thf(mimplies_def, definition, mimplies = (^ [A:($i > $o),B:($i > $o),C:$i]: ((A @ C) => (B @ C))) ).
% 4.33/2.45 thf(mequiv_def, definition, mequiv = (^ [A:($i > $o),B:($i > $o),C:$i]: ((A @ C) = (B @ C))) ).
% 4.33/2.45 thf(mforall_ind_def, definition, mforall_ind = (^ [A:(mu > ($i > $o)),B:$i]: ! [C:mu]: (A @ C @ B)) ).
% 4.33/2.45 thf(mforall_indset_def, definition, mforall_indset = (^ [A:((mu > ($i > $o)) > ($i > $o)),B:$i]: ! [C:(mu > ($i > $o))]: (A @ C @ B)) ).
% 4.33/2.45 thf(mexists_ind_def, definition, mexists_ind = (^ [A:(mu > ($i > $o)),B:$i]: ? [C:mu]: (A @ C @ B)) ).
% 4.33/2.45 thf(mbox_generic_def, definition, mbox_generic = (^ [A:($i > ($i > $o)),B:($i > $o),C:$i]: ! [D:$i]: (~ (A @ C @ D) | (B @ D))) ).
% 4.33/2.45 thf(mdia_generic_def, definition, mdia_generic = (^ [A:($i > ($i > $o)),B:($i > $o),C:$i]: ? [D:$i]: ((A @ C @ D) & (B @ D))) ).
% 4.33/2.45 thf(mbox_def, definition, mbox = (mbox_generic @ rel) ).
% 4.33/2.45 thf(mdia_def, definition, mdia = (mdia_generic @ rel) ).
% 4.33/2.45 thf(mvalid_def, definition, mvalid = ((!) @ $i) ).
% 4.33/2.45 thf(1,conjecture,((mvalid @ (mforall_indset @ (^ [A:(mu > ($i > $o))]: (mimplies @ (positive @ A) @ (mdia @ (mexists_ind @ A))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thmT1)).
% 4.33/2.45 thf(2,negated_conjecture,((~ (mvalid @ (mforall_indset @ (^ [A:(mu > ($i > $o))]: (mimplies @ (positive @ A) @ (mdia @ (mexists_ind @ A)))))))),inference(neg_conjecture,[status(cth)],[1])).
% 4.33/2.45 thf(5,plain,((~ (! [A:$i,B:(mu > ($i > $o))]: ((positive @ (B) @ A) => (? [C:$i]: ((rel @ A @ C) & ? [D:mu]: (B @ D @ C))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
% 4.33/2.45 thf(3,axiom,((mvalid @ (mforall_indset @ (^ [A:(mu > ($i > $o))]: (mequiv @ (positive @ (^ [B:mu]: (mnot @ (A @ B)))) @ (mnot @ (positive @ A))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axA1)).
% 4.33/2.45 thf(9,plain,((! [A:$i,B:(mu > ($i > $o))]: ((positive @ (^ [C:mu,D:$i]: ~ (B @ C @ D)) @ A) = (~ (positive @ (B) @ A))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[3])).
% 4.33/2.45 thf(4,axiom,((mvalid @ (mforall_indset @ (^ [A:(mu > ($i > $o))]: (mforall_indset @ (^ [B:(mu > ($i > $o))]: (mimplies @ (mand @ (positive @ A) @ (mbox @ (mforall_ind @ (^ [C:mu]: (mimplies @ (A @ C) @ (B @ C)))))) @ (positive @ B)))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axA2)).
% 4.33/2.45 thf(12,plain,((! [A:$i,B:(mu > ($i > $o)),C:(mu > ($i > $o))]: (((positive @ (B) @ A) & ! [D:$i]: (~ (rel @ A @ D) | ! [E:mu]: ((B @ E @ D) => (C @ E @ D)))) => (positive @ (C) @ A)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[4])).
% 4.33/2.45 thf(29,plain,(($false)),inference(e,[status(thm)],[5,9,12])).
% 4.33/2.45 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.33/2.45 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------