TSTP Solution File: SWB003+2 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 19 12:07:49 EDT 2023
% Result : Theorem 2.47s 1.46s
% Output : Refutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 8 ( 0 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 23 ( 3 ~; 0 |; 0 &; 20 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 4 ( 0 ^; 1 !; 3 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(iext_type,type,
iext: $i > $i > $i > $o ).
thf(uri_ex_p_type,type,
uri_ex_p: $i ).
thf(uri_ex_s_type,type,
uri_ex_s: $i ).
thf(literal_plain_type,type,
literal_plain: $i > $i ).
thf(dat_str_foo_type,type,
dat_str_foo: $i ).
thf(3,axiom,
iext @ uri_ex_p @ uri_ex_s @ ( literal_plain @ dat_str_foo ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
thf(6,plain,
iext @ uri_ex_p @ uri_ex_s @ ( literal_plain @ dat_str_foo ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,conjecture,
? [A: $i] : ( iext @ uri_ex_p @ uri_ex_s @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
thf(2,negated_conjecture,
~ ? [A: $i] : ( iext @ uri_ex_p @ uri_ex_s @ A ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ? [A: $i] : ( iext @ uri_ex_p @ uri_ex_s @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [A: $i] :
~ ( iext @ uri_ex_p @ uri_ex_s @ A ),
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
$false,
inference(rewrite,[status(thm)],[6,5]) ).
thf(8,plain,
$false,
inference(simp,[status(thm)],[7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 18 20:51:40 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.83/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.94 % [INFO] Parsing done (101ms).
% 1.19/0.95 % [INFO] Running in sequential loop mode.
% 1.47/1.14 % [INFO] eprover registered as external prover.
% 1.47/1.14 % [INFO] cvc4 registered as external prover.
% 1.47/1.15 % [INFO] Scanning for conjecture ...
% 1.72/1.19 % [INFO] Found a conjecture and 1 axioms. Running axiom selection ...
% 1.80/1.21 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.80/1.22 % [INFO] Problem is first-order (TPTP FOF).
% 1.80/1.22 % [INFO] Type checking passed.
% 1.80/1.22 % [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.45 % [INFO] Killing All external provers ...
% 2.47/1.45 % Time passed: 930ms (effective reasoning time: 498ms)
% 2.47/1.45 % 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.47/1.45 % Axioms used in derivation (1): testcase_premise_fullish_003_Blank_Nodes_for_Literals
% 2.47/1.45 % No. of inferences in proof: 8
% 2.47/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 930 ms resp. 498 ms w/o parsing
% 2.49/1.47 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.49/1.47 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------