TSTP Solution File: SEV487^1 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV487^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n032.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 : Mon Jun 24 15:59:09 EDT 2024
% Result : Theorem 2.58s 1.49s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 6 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 64 ( 8 ~; 0 |; 4 &; 50 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 22 ( 0 ^ 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf('\'const/sets/pairwise\'_type',type,
'\'const/sets/pairwise\'':
!>[TA: $tType] : ( ( TA > TA > $o ) > ( TA > $o ) > $o ) ).
thf('\'const/sets/IN\'_type',type,
'\'const/sets/IN\'':
!>[TA: $tType] : ( TA > ( TA > $o ) > $o ) ).
thf('\'const/sets/EMPTY\'_type',type,
'\'const/sets/EMPTY\'':
!>[TA: $tType] : ( TA > $o ) ).
thf(skt1_type,type,
skt1: $tType ).
thf(sk1_type,type,
sk1: skt1 > skt1 > $o ).
thf(1,conjecture,
! [TA: $tType,A: TA > TA > $o] :
( ( '\'const/sets/pairwise\'' @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TA ) )
= $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/PAIRWISE_EMPTY_') ).
thf(2,negated_conjecture,
~ ! [TA: $tType,A: TA > TA > $o] :
( ( '\'const/sets/pairwise\'' @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TA ) )
= $true ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ! [TA: $tType,A: TA > TA > $o] : ( '\'const/sets/pairwise\'' @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TA ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
~ ( '\'const/sets/pairwise\'' @ skt1 @ sk1 @ ( '\'const/sets/EMPTY\'' @ skt1 ) ),
inference(cnf,[status(esa)],[5]) ).
thf(4,axiom,
! [TA: $tType,A: TA > $o,B: TA > TA > $o] :
( ( '\'const/sets/pairwise\'' @ TA @ B @ A )
= ( ! [C: TA,D: TA] :
( ( ( '\'const/sets/IN\'' @ TA @ C @ A )
& ( '\'const/sets/IN\'' @ TA @ D @ A )
& ( C != D ) )
=> ( B @ C @ D ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/pairwise_') ).
thf(9,plain,
! [TA: $tType,A: TA > $o,B: TA > TA > $o] :
( ( '\'const/sets/pairwise\'' @ TA @ B @ A )
= ( ! [C: TA,D: TA] :
( ( ( '\'const/sets/IN\'' @ TA @ C @ A )
& ( '\'const/sets/IN\'' @ TA @ D @ A )
& ( C != D ) )
=> ( B @ C @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [TA: $tType,A: TA] :
~ ( '\'const/sets/IN\'' @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TA ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/NOT_IN_EMPTY_') ).
thf(7,plain,
! [TA: $tType,A: TA] :
~ ( '\'const/sets/IN\'' @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TA ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(8,plain,
! [TA: $tType,A: TA] :
~ ( '\'const/sets/IN\'' @ TA @ A @ ( '\'const/sets/EMPTY\'' @ TA ) ),
inference(cnf,[status(esa)],[7]) ).
thf(28,plain,
$false,
inference(e,[status(thm)],[5,6,9,7,8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SEV487^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.08 % Command : run_Leo-III %s %d THM
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Fri Jun 21 19:41:40 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.66/0.67 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.89/0.77 % [INFO] Parsing done (99ms).
% 0.89/0.77 % [INFO] Running in sequential loop mode.
% 1.19/0.97 % [INFO] eprover registered as external prover.
% 1.19/0.97 % [INFO] Scanning for conjecture ...
% 1.29/1.02 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 1.41/1.04 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.41/1.05 % [INFO] Problem is higher-order (TPTP THF).
% 1.41/1.05 % [INFO] Type checking passed.
% 1.41/1.05 % [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.58/1.49 % External prover 'e' found a proof!
% 2.58/1.49 % [INFO] Killing All external provers ...
% 2.58/1.49 % Time passed: 1095ms (effective reasoning time: 710ms)
% 2.58/1.49 % 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.58/1.49 % Axioms used in derivation (2): thm/sets/pairwise_, thm/sets/NOT_IN_EMPTY_
% 2.58/1.49 % No. of inferences in proof: 10
% 2.58/1.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1095 ms resp. 710 ms w/o parsing
% 2.58/1.51 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.58/1.51 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------