%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : COM190^1 : TPTP v9.3.1. Released v7.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 : n008.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 07:46:19 AM UTC 2026
% Result : Theorem 14.03s 4.68s
% Output : Refutation 14.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 7 ( 0 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 12 ( 2 ~; 0 |; 0 &; 10 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(dtree_type,type,
dtree: $tType ).
thf(nat_type,type,
nat: $tType ).
thf(n_type,type,
n: $tType ).
thf(gram_L250615845e_path_decl,type,
gram_L250615845e_path: ( n > dtree ) > ( list @ n ) > $o ).
thf(f_decl,type,
f: n > dtree ).
thf(nla_decl,type,
nla: list @ n ).
thf(130,axiom,
gram_L250615845e_path @ f @ nla,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__C1_Oprems_C) ).
thf(650,plain,
gram_L250615845e_path @ f @ nla,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[130]) ).
thf(1,conjecture,
gram_L250615845e_path @ f @ nla,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(2,negated_conjecture,
~ ( gram_L250615845e_path @ f @ nla ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(138,plain,
~ ( gram_L250615845e_path @ f @ nla ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(676,plain,
$false,
inference(rewrite,[status(thm)],[650,138]) ).
thf(677,plain,
$false,
inference(simp,[status(thm)],[676]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM190^1 : TPTP v9.3.1. Released v7.0.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.10/0.20 % Computer : n008.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 17:51:09 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/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.87/0.75 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.72/1.12 % [INFO] Parsing done (360ms).
% 1.72/1.13 % [INFO] Running in sequential loop mode.
% 3.05/1.51 % [INFO] eprover registered as external prover.
% 3.05/1.52 % [INFO] Scanning for conjecture ...
% 3.21/1.66 % [INFO] Found a conjecture (or negated_conjecture) and 272 axioms. Running axiom selection ...
% 3.39/1.78 % [INFO] Axiom selection finished. Selected 135 axioms (removed 137 axioms).
% 4.11/2.01 % [INFO] Problem is higher-order (TPTP THF).
% 4.11/2.03 % [INFO] Type checking passed.
% 4.42/2.03 % [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 ...
% 14.03/4.67 % [INFO] Killing All external provers ...
% 14.03/4.68 % Time passed: 4360ms (effective reasoning time: 3540ms)
% 14.03/4.68 % 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)>
% 14.03/4.68 % Axioms used in derivation (1): fact_1__C1_Oprems_C
% 14.03/4.68 % No. of inferences in proof: 7
% 14.03/4.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4360 ms resp. 3540 ms w/o parsing
% 14.54/4.70 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.54/4.70 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------