%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET576^7 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n012.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:22:57 AM UTC 2026
% Result : Theorem 2.20s 1.18s
% Output : Refutation 2.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET576^7 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 13:37:18 UTC 2026
% 0.07/0.11 % CPUTime :
% 0.07/0.11 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.41/0.40 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.83/0.54 % [INFO] Parsing done (140ms).
% 0.83/0.55 % [INFO] Running in sequential loop mode.
% 1.20/0.74 % [INFO] eprover registered as external prover.
% 1.20/0.74 % [INFO] Scanning for conjecture ...
% 1.42/0.83 % [INFO] Found a conjecture (or negated_conjecture) and 7 axioms. Running axiom selection ...
% 1.42/0.85 % [INFO] Axiom selection finished. Selected 7 axioms (removed 0 axioms).
% 1.42/0.86 % [INFO] Problem is higher-order (TPTP THF).
% 1.42/0.86 % [INFO] Type checking passed.
% 1.42/0.86 % [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 ...
% 2.20/1.17 % External prover 'e' found a proof!
% 2.20/1.17 % [INFO] Killing All external provers ...
% 2.20/1.18 % Time passed: 987ms (effective reasoning time: 623ms)
% 2.20/1.18 % 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)>
% 2.20/1.18 % Axioms used in derivation (7): intersect_defn, cumulative_ax, disjoint_defn, a1, nonempty_ax, symmetry_of_intersect, a2
% 2.20/1.18 % No. of inferences in proof: 18
% 2.20/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 987 ms resp. 623 ms w/o parsing
% 2.49/1.22 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.49/1.22 thf(mu_type, type, mu: $tType).
% 2.49/1.22 thf(mnot_decl, type, mnot: (($i > $o) > ($i > $o))).
% 2.49/1.22 thf(mor_decl, type, mor: (($i > $o) > (($i > $o) > ($i > $o)))).
% 2.49/1.22 thf(mand_decl, type, mand: (($i > $o) > (($i > $o) > ($i > $o)))).
% 2.49/1.22 thf(mimplies_decl, type, mimplies: (($i > $o) > (($i > $o) > ($i > $o)))).
% 2.49/1.22 thf(mequiv_decl, type, mequiv: (($i > $o) > (($i > $o) > ($i > $o)))).
% 2.49/1.22 thf(exists_in_world_decl, type, exists_in_world: (mu > ($i > $o))).
% 2.49/1.22 thf(mforall_ind_decl, type, mforall_ind: ((mu > ($i > $o)) > ($i > $o))).
% 2.49/1.22 thf(mexists_ind_decl, type, mexists_ind: ((mu > ($i > $o)) > ($i > $o))).
% 2.49/1.22 thf(mreflexive_decl, type, mreflexive: (($i > ($i > $o)) > $o)).
% 2.49/1.22 thf(mtransitive_decl, type, mtransitive: (($i > ($i > $o)) > $o)).
% 2.49/1.22 thf(mvalid_decl, type, mvalid: (($i > $o) > $o)).
% 2.49/1.22 thf(rel_s4_decl, type, rel_s4: ($i > ($i > $o))).
% 2.49/1.22 thf(intersect_decl, type, intersect: (mu > (mu > ($i > $o)))).
% 2.49/1.22 thf(disjoint_decl, type, disjoint: (mu > (mu > ($i > $o)))).
% 2.49/1.22 thf(member_decl, type, member: (mu > (mu > ($i > $o)))).
% 2.49/1.22 thf(mnot_def, definition, mnot = (^ [A:($i > $o),B:$i]: ~ (A @ B)) ).
% 2.49/1.22 thf(mor_def, definition, mor = (^ [A:($i > $o),B:($i > $o),C:$i]: ((A @ C) | (B @ C))) ).
% 2.49/1.22 thf(mand_def, definition, mand = (^ [A:($i > $o),B:($i > $o)]: (mnot @ (mor @ (mnot @ A) @ (mnot @ B)))) ).
% 2.49/1.22 thf(mimplies_def, definition, mimplies = (^ [A:($i > $o)]: (mor @ (mnot @ A))) ).
% 2.49/1.22 thf(mequiv_def, definition, mequiv = (^ [A:($i > $o),B:($i > $o)]: (mand @ (mimplies @ A @ B) @ (mimplies @ B @ A))) ).
% 2.49/1.22 thf(mforall_ind_def, definition, mforall_ind = (^ [A:(mu > ($i > $o)),B:$i]: ! [C:mu]: ((exists_in_world @ C @ B) => (A @ C @ B))) ).
% 2.49/1.22 thf(mexists_ind_def, definition, mexists_ind = (^ [A:(mu > ($i > $o))]: (mnot @ (mforall_ind @ (^ [B:mu]: (mnot @ (A @ B)))))) ).
% 2.49/1.22 thf(mreflexive_def, definition, mreflexive = (^ [A:($i > ($i > $o))]: ! [B:$i]: (A @ B @ B)) ).
% 2.49/1.22 thf(mtransitive_def, definition, mtransitive = (^ [A:($i > ($i > $o))]: ! [B:$i,C:$i,D:$i]: (((A @ B @ C) & (A @ C @ D)) => (A @ B @ D))) ).
% 2.49/1.22 thf(mvalid_def, definition, mvalid = ((!) @ $i) ).
% 2.49/1.22 thf(1,conjecture,((mvalid @ (mforall_ind @ (^ [A:mu]: (mforall_ind @ (^ [B:mu]: (mimplies @ (mforall_ind @ (^ [C:mu]: (mimplies @ (member @ C @ A) @ (mnot @ (member @ C @ B))))) @ (disjoint @ A @ B)))))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th17)).
% 2.49/1.22 thf(2,negated_conjecture,((~ (mvalid @ (mforall_ind @ (^ [A:mu]: (mforall_ind @ (^ [B:mu]: (mimplies @ (mforall_ind @ (^ [C:mu]: (mimplies @ (member @ C @ A) @ (mnot @ (member @ C @ B))))) @ (disjoint @ A @ B))))))))),inference(neg_conjecture,[status(cth)],[1])).
% 2.49/1.22 thf(10,plain,((~ (! [A:$i,B:mu]: ((exists_in_world @ B @ A) => (! [C:mu]: ((exists_in_world @ C @ A) => (~ (! [D:mu]: ((exists_in_world @ D @ A) => (~ (member @ D @ B @ A) | ~ (member @ D @ C @ A)))) | (disjoint @ B @ C @ A)))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
% 2.49/1.22 thf(7,axiom,((mvalid @ (mforall_ind @ (^ [A:mu]: (mforall_ind @ (^ [B:mu]: (mequiv @ (intersect @ A @ B) @ (mexists_ind @ (^ [C:mu]: (mand @ (member @ C @ A) @ (member @ C @ B))))))))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn)).
% 2.49/1.22 thf(24,plain,((! [A:$i,B:mu]: ((exists_in_world @ B @ A) => (! [C:mu]: ((exists_in_world @ C @ A) => (~ (~ (~ (intersect @ B @ C @ A) | ~ (! [D:mu]: ((exists_in_world @ D @ A) => (~ (member @ D @ B @ A) | ~ (member @ D @ C @ A))))) | ~ (! [D:mu]: ((exists_in_world @ D @ A) => (~ (member @ D @ B @ A) | ~ (member @ D @ C @ A))) | (intersect @ B @ C @ A))))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[7])).
% 2.49/1.22 thf(5,axiom,((mtransitive @ rel_s4)),file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2)).
% 2.49/1.22 thf(20,plain,((! [A:$i,B:$i,C:$i]: (((rel_s4 @ A @ B) & (rel_s4 @ B @ C)) => (rel_s4 @ A @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[5])).
% 2.49/1.22 thf(9,axiom,((mvalid @ (mforall_ind @ (^ [A:mu]: (mforall_ind @ (^ [B:mu]: (mimplies @ (intersect @ A @ B) @ (intersect @ B @ A)))))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_intersect)).
% 2.49/1.22 thf(34,plain,((! [A:$i,B:mu]: ((exists_in_world @ B @ A) => (! [C:mu]: ((exists_in_world @ C @ A) => (~ (intersect @ B @ C @ A) | (intersect @ C @ B @ A))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[9])).
% 2.49/1.22 thf(6,axiom,((! [A:mu,B:$i,C:$i]: (((exists_in_world @ A @ B) & (rel_s4 @ B @ C)) => (exists_in_world @ A @ C)))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',cumulative_ax)).
% 2.49/1.22 thf(22,plain,((! [A:mu,B:$i,C:$i]: (((exists_in_world @ A @ B) & (rel_s4 @ B @ C)) => (exists_in_world @ A @ C)))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[6])).
% 2.49/1.22 thf(4,axiom,((mreflexive @ rel_s4)),file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1)).
% 2.49/1.22 thf(18,plain,((! [A:$i]: (rel_s4 @ A @ A))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[4])).
% 2.49/1.22 thf(3,axiom,((! [A:$i]: ? [B:mu]: (exists_in_world @ B @ A))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonempty_ax)).
% 2.49/1.22 thf(16,plain,((! [A:$i]: ? [B:mu]: (exists_in_world @ B @ A))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[3])).
% 2.49/1.22 thf(8,axiom,((mvalid @ (mforall_ind @ (^ [A:mu]: (mforall_ind @ (^ [B:mu]: (mequiv @ (disjoint @ A @ B) @ (mnot @ (intersect @ A @ B))))))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn)).
% 2.49/1.22 thf(30,plain,((! [A:$i,B:mu]: ((exists_in_world @ B @ A) => (! [C:mu]: ((exists_in_world @ C @ A) => (~ (~ (~ (disjoint @ B @ C @ A) | ~ (intersect @ B @ C @ A)) | ~ ((intersect @ B @ C @ A) | (disjoint @ B @ C @ A))))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[8])).
% 2.49/1.22 thf(36,plain,(($false)),inference(e,[status(thm)],[10,24,20,34,22,18,16,30])).
% 2.49/1.22 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.49/1.22 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------