%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU924^5 : TPTP v9.3.1. Released v4.0.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 : 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:29:35 AM UTC 2026
% Result : Theorem 1.69s 1.08s
% Output : Refutation 1.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU924^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % 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.07/0.12 % Computer : n012.cluster.edu
% 0.07/0.12 % Model : x86_64 x86_64
% 0.07/0.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.12 % Memory : 8046.5625MB
% 0.07/0.12 % OS : Linux 6.8.0-71-generic
% 0.07/0.12 % CPULimit : 300
% 0.07/0.12 % WCLimit : 300
% 0.07/0.12 % DateTime : Tue Sep 29 14:46:03 UTC 2026
% 0.07/0.12 % CPUTime :
% 0.07/0.12 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.40/0.40 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.56/0.50 % [INFO] Parsing done (92ms).
% 0.56/0.50 % [INFO] Running in sequential loop mode.
% 0.86/0.69 % [INFO] eprover registered as external prover.
% 1.00/0.70 % [INFO] Scanning for conjecture ...
% 1.00/0.74 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.00/0.75 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.00/0.75 % [INFO] Problem is higher-order (TPTP THF).
% 1.00/0.76 % [INFO] Type checking passed.
% 1.00/0.76 % [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 ...
% 1.69/1.07 % [INFO] Killing All external provers ...
% 1.69/1.08 % Time passed: 882ms (effective reasoning time: 568ms)
% 1.69/1.08 % 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)>
% 1.69/1.08 % Axioms used in derivation (0):
% 1.69/1.08 % No. of inferences in proof: 14
% 1.69/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 882 ms resp. 568 ms w/o parsing
% 1.99/1.11 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.99/1.11 thf(sk1_decl, type, sk1: $i).
% 1.99/1.11 thf(sk2_decl, type, sk2: ($i > $i)).
% 1.99/1.11 thf(sk3_decl, type, sk3: ((($i > $i) > $o) > ($i > $i))).
% 1.99/1.11 thf(sk4_decl, type, sk4: $i).
% 1.99/1.11 thf(sk1_def, definition, sk1 = (@+ [A:$i]: ~ (! [B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ (^ [D:$i]: (A))) & ((? [D:($i > $i)]: (C @ (D))) => (C @ (^ [D:$i]: (A))))) => (C @ (B)))) => (! [C:$i]: ((B @ C) = A))))) ).
% 1.99/1.11 thf(sk2_def, definition, sk2 = (@+ [A:($i > $i)]: ~ ((! [B:(($i > $i) > $o)]: (((B @ (^ [C:$i]: (sk1))) & ((? [C:($i > $i)]: (B @ (C))) => (B @ (^ [C:$i]: (sk1))))) => (B @ (A)))) => (! [B:$i]: ((A @ B) = sk1)))) ).
% 1.99/1.11 thf(sk3_def, definition, sk3 = ((@+) @ ($i > $i)) ).
% 1.99/1.11 thf(sk4_def, definition, sk4 = (@+ [A:$i]: ~ ((sk2 @ A) = sk1)) ).
% 1.99/1.11 thf(1,conjecture,((! [A:$i,B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ (^ [D:$i]: (A))) & ! [D:($i > $i)]: ((C @ D) => (C @ (^ [E:$i]: (A))))) => (C @ B))) => (! [C:$i]: ((B @ C) = A))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM134_pme)).
% 1.99/1.11 thf(2,negated_conjecture,((~ (! [A:$i,B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ (^ [D:$i]: (A))) & ! [D:($i > $i)]: ((C @ D) => (C @ (^ [E:$i]: (A))))) => (C @ B))) => (! [C:$i]: ((B @ C) = A)))))),inference(neg_conjecture,[status(cth)],[1])).
% 1.99/1.11 thf(3,plain,((~ (! [A:$i,B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ (^ [D:$i]: (A))) & ! [D:($i > $i)]: ((C @ (D)) => (C @ (^ [E:$i]: (A))))) => (C @ (B)))) => (! [C:$i]: ((B @ C) = A)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
% 1.99/1.11 thf(4,plain,((~ (! [A:$i,B:($i > $i)]: ((! [C:(($i > $i) > $o)]: (((C @ (^ [D:$i]: (A))) & ((? [D:($i > $i)]: (C @ (D))) => (C @ (^ [D:$i]: (A))))) => (C @ (B)))) => (! [C:$i]: ((B @ C) = A)))))),inference(miniscope,[status(thm)],[3])).
% 1.99/1.11 thf(5,plain,(! [A:(($i > $i) > $o)] : (((~ (A @ (^ [B:$i]: (sk1))) | (A @ (sk3 @ (A))) | (A @ (sk2))) & (~ (A @ (^ [B:$i]: (sk1))) | ~ (A @ (^ [B:$i]: (sk1))) | (A @ (sk2))) & ~ ((sk2 @ sk4) = sk1)))),inference(cnf,[status(esa)],[4])).
% 1.99/1.11 thf(8,plain,((~ ((sk2 @ sk4) = sk1))),inference(cnfConj,[status(thm)],[5])).
% 1.99/1.11 thf(16,plain,(((sk2 @ sk4) != sk1)),inference(lifteq,[status(thm)],[8])).
% 1.99/1.11 thf(7,plain,(! [A:(($i > $i) > $o)] : ((~ (A @ (^ [B:$i]: (sk1)))) | (~ (A @ (^ [B:$i]: (sk1)))) | (A @ (sk2)))),inference(cnfConj,[status(thm)],[5])).
% 1.99/1.11 thf(10,plain,((~ ((^ [A:$i]: (sk1)) = (^ [A:$i]: (sk1)))) | (~ ((^ [A:$i]: (sk1)) = (^ [A:$i]: (sk1)))) | ((^ [A:$i]: (sk1)) = (sk2))),inference(replace_leibeq,[status(thm)],[7:[bind(A, $thf((=) @ ($i > $i) @ (^ [B:$i]: (sk1))))]])).
% 1.99/1.11 thf(11,plain,(((^ [A:$i]: (sk1)) != (^ [A:$i]: (sk1))) | ((^ [A:$i]: (sk1)) != (^ [A:$i]: (sk1))) | ((sk2) = (^ [A:$i]: (sk1)))),inference(lifteq,[status(thm)],[10])).
% 1.99/1.11 thf(12,plain,(((sk2) = (^ [A:$i]: (sk1)))),inference(simp,[status(thm)],[11])).
% 1.99/1.11 thf(17,plain,(! [A:$i] : (((sk2 @ A) = sk1))),inference(func_ext,[status(esa)],[12])).
% 1.99/1.11 thf(18,plain,((sk1 != sk1)),inference(rewrite,[status(thm)],[16,17])).
% 1.99/1.11 thf(19,plain,(($false)),inference(simp,[status(thm)],[18])).
% 1.99/1.11 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.99/1.11 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------