TSTP Solution File: SEU609^2 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU609^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n014.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:42:57 EDT 2024
% Result : Theorem 2.77s 1.70s
% Output : Refutation 2.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 8 unt; 8 typ; 2 def)
% Number of atoms : 47 ( 5 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 148 ( 11 ~; 7 |; 0 &; 118 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 0 ^ 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(subset_type,type,
subset: $i > $i > $o ).
thf(subsetI2_type,type,
subsetI2: $o ).
thf(subsetI2_def,definition,
( subsetI2
= ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) ) ) ) ).
thf(setminus_type,type,
setminus: $i > $i > $i ).
thf(setminusEL_type,type,
setminusEL: $o ).
thf(setminusEL_def,definition,
( setminusEL
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setminus @ A @ B ) )
=> ( in @ C @ A ) ) ) ) ).
thf(sk1_type,type,
sk1: $i > $i > $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
( subsetI2
=> ( setminusEL
=> ! [A: $i,B: $i] : ( subset @ ( setminus @ A @ B ) @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusLsub) ).
thf(2,negated_conjecture,
~ ( subsetI2
=> ( setminusEL
=> ! [A: $i,B: $i] : ( subset @ ( setminus @ A @ B ) @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setminus @ A @ B ) )
=> ( in @ C @ A ) )
=> ! [A: $i,B: $i] : ( subset @ ( setminus @ A @ B ) @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
! [B: $i,A: $i] :
( ( in @ ( sk1 @ B @ A ) @ A )
| ( subset @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
~ ( subset @ ( setminus @ sk2 @ sk3 ) @ sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( in @ ( sk1 @ B @ A ) @ A )
| ( ( subset @ A @ B )
!= ( subset @ ( setminus @ sk2 @ sk3 ) @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[6,4]) ).
thf(10,plain,
in @ ( sk1 @ sk2 @ ( setminus @ sk2 @ sk3 ) ) @ ( setminus @ sk2 @ sk3 ),
inference(pattern_uni,[status(thm)],[9:[bind(A,$thf( setminus @ sk2 @ sk3 )),bind(B,$thf( sk2 ))]]) ).
thf(5,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( setminus @ A @ B ) )
| ( in @ C @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( setminus @ A @ B ) )
| ( in @ C @ A ) ),
inference(simp,[status(thm)],[5]) ).
thf(28,plain,
! [C: $i,B: $i,A: $i] :
( ( in @ C @ A )
| ( ( in @ ( sk1 @ sk2 @ ( setminus @ sk2 @ sk3 ) ) @ ( setminus @ sk2 @ sk3 ) )
!= ( in @ C @ ( setminus @ A @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,8]) ).
thf(29,plain,
in @ ( sk1 @ sk2 @ ( setminus @ sk2 @ sk3 ) ) @ sk2,
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 )),bind(C,$thf( sk1 @ sk2 @ ( setminus @ sk2 @ sk3 ) ))]]) ).
thf(7,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( subset @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( ( subset @ A @ B )
!= ( subset @ ( setminus @ sk2 @ sk3 ) @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[7,4]) ).
thf(12,plain,
~ ( in @ ( sk1 @ sk2 @ ( setminus @ sk2 @ sk3 ) ) @ sk2 ),
inference(pattern_uni,[status(thm)],[11:[bind(A,$thf( setminus @ sk2 @ sk3 )),bind(B,$thf( sk2 ))]]) ).
thf(33,plain,
$false,
inference(rewrite,[status(thm)],[29,12]) ).
thf(34,plain,
$false,
inference(simp,[status(thm)],[33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU609^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n014.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 : Sun May 19 16:52:09 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.85/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.95 % [INFO] Parsing done (105ms).
% 1.21/0.95 % [INFO] Running in sequential loop mode.
% 1.64/1.17 % [INFO] nitpick registered as external prover.
% 1.64/1.18 % [INFO] Scanning for conjecture ...
% 1.82/1.24 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.82/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.82/1.26 % [INFO] Problem is higher-order (TPTP THF).
% 1.82/1.27 % [INFO] Type checking passed.
% 1.82/1.27 % [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.77/1.69 % [INFO] Killing All external provers ...
% 2.77/1.70 % Time passed: 1187ms (effective reasoning time: 737ms)
% 2.77/1.70 % 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.77/1.70 % Axioms used in derivation (0):
% 2.77/1.70 % No. of inferences in proof: 16
% 2.77/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1187 ms resp. 737 ms w/o parsing
% 2.99/1.73 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.99/1.73 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------