TSTP Solution File: SET019+4 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SET019+4 : TPTP v8.1.2. Released v2.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 : Tue May 7 10:48:45 EDT 2024
% Result : Theorem 12.83s 3.80s
% Output : Refutation 12.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 43 ( 1 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 118 ( 14 ~; 8 |; 10 &; 78 @)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_type,type,
subset: $i > $i > $o ).
thf(equal_set_type,type,
equal_set: $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( equal_set @ A @ B )
<=> ( ( subset @ A @ B )
& ( subset @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
thf(25,plain,
! [A: $i,B: $i] :
( ( ( equal_set @ A @ B )
=> ( ( subset @ A @ B )
& ( subset @ B @ A ) ) )
& ( ( ( subset @ A @ B )
& ( subset @ B @ A ) )
=> ( equal_set @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(26,plain,
( ! [A: $i,B: $i] :
( ( equal_set @ A @ B )
=> ( ( subset @ A @ B )
& ( subset @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( subset @ A @ B )
& ( subset @ B @ A ) )
=> ( equal_set @ A @ B ) ) ),
inference(miniscope,[status(thm)],[25]) ).
thf(27,plain,
! [B: $i,A: $i] :
( ~ ( subset @ A @ B )
| ~ ( subset @ B @ A )
| ( equal_set @ A @ B ) ),
inference(cnf,[status(esa)],[26]) ).
thf(30,plain,
! [B: $i,A: $i] :
( ~ ( subset @ A @ B )
| ~ ( subset @ B @ A )
| ( equal_set @ A @ B ) ),
inference(simp,[status(thm)],[27]) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( ( subset @ A @ B )
& ( subset @ B @ A ) )
=> ( equal_set @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI02) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( ( subset @ A @ B )
& ( subset @ B @ A ) )
=> ( equal_set @ A @ B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(14,plain,
~ ! [A: $i,B: $i] :
( ( ( subset @ A @ B )
& ( subset @ B @ A ) )
=> ( equal_set @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(15,plain,
~ ( equal_set @ sk1 @ sk2 ),
inference(cnf,[status(esa)],[14]) ).
thf(1285,plain,
! [B: $i,A: $i] :
( ~ ( subset @ A @ B )
| ~ ( subset @ B @ A )
| ( ( equal_set @ A @ B )
!= ( equal_set @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[30,15]) ).
thf(1286,plain,
( ~ ( subset @ sk1 @ sk2 )
| ~ ( subset @ sk2 @ sk1 ) ),
inference(pattern_uni,[status(thm)],[1285:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(16,plain,
subset @ sk2 @ sk1,
inference(cnf,[status(esa)],[14]) ).
thf(17,plain,
subset @ sk1 @ sk2,
inference(cnf,[status(esa)],[14]) ).
thf(1521,plain,
( ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[1286,16,17]) ).
thf(1522,plain,
$false,
inference(simp,[status(thm)],[1521]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SET019+4 : TPTP v8.1.2. Released v2.2.0.
% 0.10/0.12 % Command : run_Leo-III %s %d
% 0.11/0.31 % Computer : n004.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 6 20:52:09 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.96/0.90 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.28/1.07 % [INFO] Parsing done (165ms).
% 1.28/1.07 % [INFO] Running in sequential loop mode.
% 1.67/1.36 % [INFO] nitpick registered as external prover.
% 1.86/1.37 % [INFO] Scanning for conjecture ...
% 1.96/1.45 % [INFO] Found a conjecture and 11 axioms. Running axiom selection ...
% 2.03/1.47 % [INFO] Axiom selection finished. Selected 11 axioms (removed 0 axioms).
% 2.03/1.50 % [INFO] Problem is first-order (TPTP FOF).
% 2.03/1.51 % [INFO] Type checking passed.
% 2.03/1.51 % [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 ...
% 12.83/3.79 % [INFO] Killing All external provers ...
% 12.83/3.80 % Time passed: 3340ms (effective reasoning time: 2709ms)
% 12.83/3.80 % 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)>
% 12.83/3.80 % Axioms used in derivation (1): equal_set
% 12.83/3.80 % No. of inferences in proof: 15
% 12.83/3.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3340 ms resp. 2709 ms w/o parsing
% 12.83/3.83 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.83/3.83 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------