TSTP Solution File: SEU603^2 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU603^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n008.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:38:30 EDT 2024
% Result : Theorem 2.80s 1.83s
% Output : Refutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 10 ( 3 unt; 4 typ; 2 def)
% Number of atoms : 16 ( 2 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 7 ~; 0 |; 0 &; 34 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 4 ^ 15 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(dsetconstr_type,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(dsetconstrER_type,type,
dsetconstrER: $o ).
thf(dsetconstrER_def,definition,
( dsetconstrER
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) ) ) ) ).
thf(setminus_type,type,
setminus: $i > $i > $i ).
thf(setminus_def,definition,
( setminus
= ( ^ [A: $i,B: $i] :
( dsetconstr @ A
@ ^ [C: $i] :
~ ( in @ C @ B ) ) ) ) ).
thf(1,conjecture,
( dsetconstrER
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setminus @ A @ B ) )
=> ~ ( in @ C @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER) ).
thf(2,negated_conjecture,
~ ( dsetconstrER
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setminus @ A @ B ) )
=> ~ ( in @ C @ B ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) )
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C
@ ( dsetconstr @ A
@ ^ [D: $i] :
~ ( in @ D @ B ) ) )
=> ~ ( in @ C @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SEU603^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.14 % Command : run_Leo-III %s %d
% 0.12/0.35 % Computer : n008.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sun May 19 15:36:09 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.81/0.82 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.09/0.95 % [INFO] Parsing done (123ms).
% 1.09/0.96 % [INFO] Running in sequential loop mode.
% 1.52/1.26 % [INFO] eprover registered as external prover.
% 1.52/1.26 % [INFO] cvc4 registered as external prover.
% 1.52/1.27 % [INFO] Scanning for conjecture ...
% 1.71/1.33 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.71/1.36 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.71/1.37 % [INFO] Problem is higher-order (TPTP THF).
% 1.86/1.37 % [INFO] Type checking passed.
% 1.86/1.37 % [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.71/1.82 % External prover 'e' found a proof!
% 2.80/1.82 % [INFO] Killing All external provers ...
% 2.80/1.83 % Time passed: 1360ms (effective reasoning time: 858ms)
% 2.80/1.83 % 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.80/1.83 % Axioms used in derivation (0):
% 2.80/1.83 % No. of inferences in proof: 4
% 2.80/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1360 ms resp. 858 ms w/o parsing
% 2.80/1.85 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.80/1.85 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------