TSTP Solution File: SEU738^2 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU738^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n029.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 : Tue May 21 03:39:28 EDT 2024
% Result : Theorem 2.65s 1.51s
% Output : Refutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 2 unt; 4 typ; 1 def)
% Number of atoms : 24 ( 1 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 79 ( 8 ~; 0 |; 0 &; 54 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(powerset_type,type,
powerset: $i > $i ).
thf(binunion_type,type,
binunion: $i > $i > $i ).
thf(binunionIL_type,type,
binunionIL: $o ).
thf(binunionIL_def,definition,
( binunionIL
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ( in @ C @ ( binunion @ A @ B ) ) ) ) ) ).
thf(1,conjecture,
( binunionIL
=> ! [A: $i,B: $i] :
( ( in @ B @ ( powerset @ A ) )
=> ! [C: $i] :
( ( in @ C @ ( powerset @ A ) )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ ( in @ D @ ( binunion @ B @ C ) )
=> ~ ( in @ D @ B ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binunionTILcontra) ).
thf(2,negated_conjecture,
~ ( binunionIL
=> ! [A: $i,B: $i] :
( ( in @ B @ ( powerset @ A ) )
=> ! [C: $i] :
( ( in @ C @ ( powerset @ A ) )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ ( in @ D @ ( binunion @ B @ C ) )
=> ~ ( in @ D @ B ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ( in @ C @ ( binunion @ A @ B ) ) )
=> ! [A: $i,B: $i] :
( ( in @ B @ ( powerset @ A ) )
=> ! [C: $i] :
( ( in @ C @ ( powerset @ A ) )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ ( in @ D @ ( binunion @ B @ C ) )
=> ~ ( in @ D @ B ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(20,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU738^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.10 % Command : run_Leo-III %s %d
% 0.10/0.29 % Computer : n029.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun May 19 17:18:38 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.86/0.79 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.14/0.90 % [INFO] Parsing done (114ms).
% 1.14/0.91 % [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.78/1.20 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.83/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.83/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.83/1.23 % [INFO] Type checking passed.
% 1.83/1.23 % [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.65/1.51 % External prover 'e' found a proof!
% 2.65/1.51 % [INFO] Killing All external provers ...
% 2.65/1.51 % Time passed: 1112ms (effective reasoning time: 594ms)
% 2.65/1.51 % 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.65/1.51 % Axioms used in derivation (0):
% 2.65/1.51 % No. of inferences in proof: 4
% 2.65/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1112 ms resp. 594 ms w/o parsing
% 2.71/1.56 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.71/1.56 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------