%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SWB003+2 : TPTP v9.3.1. Released v5.2.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 : n013.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 : Sun Sep 27 08:50:27 AM UTC 2026
% Result : Theorem 3.19s 2.13s
% Output : Refutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 6 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 6 ( 0 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 19 ( 2 ~; 0 |; 0 &; 17 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 3 ( 0 ^; 0 !; 3 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
thf(iext_decl,type,
iext: $i > $i > $i > $o ).
thf(uri_ex_p_decl,type,
uri_ex_p: $i ).
thf(uri_ex_s_decl,type,
uri_ex_s: $i ).
thf(literal_plain_decl,type,
literal_plain: $i > $i ).
thf(dat_str_foo_decl,type,
dat_str_foo: $i ).
thf(1,conjecture,
? [A: $i] : ( A @ ( uri_ex_s @ ( uri_ex_p @ iext ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
thf(2,negated_conjecture,
~ ? [A: $i] : ( A @ ( uri_ex_s @ ( uri_ex_p @ iext ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ? [A: $i] : ( A @ ( uri_ex_s @ ( uri_ex_p @ iext ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
dat_str_foo @ literal_plain @ ( uri_ex_s @ ( uri_ex_p @ iext ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
thf(6,plain,
dat_str_foo @ literal_plain @ ( uri_ex_s @ ( uri_ex_p @ iext ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,plain,
$false,
inference(e,[status(thm)],[4,6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWB003+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07 % 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.12/0.38 % Computer : n013.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sat Sep 26 11:38:21 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 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.88/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.29/1.15 % [INFO] Parsing done (172ms).
% 1.29/1.17 % [INFO] Running in sequential loop mode.
% 1.82/1.56 % [INFO] eprover registered as external prover.
% 1.82/1.57 % [INFO] Scanning for conjecture ...
% 2.03/1.66 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 2.19/1.70 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.19/1.70 % [INFO] Problem is first-order (TPTP FOF).
% 2.19/1.71 % [INFO] Type checking passed.
% 2.19/1.72 % [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.92/2.13 % External prover 'e' found a proof!
% 2.92/2.13 % [INFO] Killing All external provers ...
% 3.19/2.13 % Time passed: 1602ms (effective reasoning time: 960ms)
% 3.19/2.13 % 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)>
% 3.19/2.13 % Axioms used in derivation (1): testcase_premise_fullish_003_Blank_Nodes_for_Literals
% 3.19/2.13 % No. of inferences in proof: 6
% 3.19/2.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1602 ms resp. 960 ms w/o parsing
% 3.19/2.17 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.19/2.17 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------