TSTP Solution File: NUM568+3 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : NUM568+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n023.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 13:01:20 EDT 2024
% Result : Theorem 158.66s 90.21s
% Output : Refutation 158.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 33 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 133 ( 25 ~; 23 |; 5 &; 78 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 ^ 11 !; 5 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(aElementOf0_type,type,
aElementOf0: $i > $i > $o ).
thf(szNzAzT0_type,type,
szNzAzT0: $i ).
thf(szszuzczcdt0_type,type,
szszuzczcdt0: $i > $i ).
thf(xK_type,type,
xK: $i ).
thf(sz00_type,type,
sz00: $i ).
thf(sk39_type,type,
sk39: $i > $i ).
thf(68,axiom,
! [A: $i] :
( ( aElementOf0 @ A @ szNzAzT0 )
=> ( ( A = sz00 )
| ? [B: $i] :
( ( aElementOf0 @ B @ szNzAzT0 )
& ( A
= ( szszuzczcdt0 @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNatExtra) ).
thf(482,plain,
! [A: $i] :
( ( aElementOf0 @ A @ szNzAzT0 )
=> ( ( A = sz00 )
| ? [B: $i] :
( ( aElementOf0 @ B @ szNzAzT0 )
& ( A
= ( szszuzczcdt0 @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[68]) ).
thf(483,plain,
! [A: $i] :
( ~ ( aElementOf0 @ A @ szNzAzT0 )
| ( A = sz00 )
| ( A
= ( szszuzczcdt0 @ ( sk39 @ A ) ) ) ),
inference(cnf,[status(esa)],[482]) ).
thf(485,plain,
! [A: $i] :
( ( A = sz00 )
| ( ( szszuzczcdt0 @ ( sk39 @ A ) )
= A )
| ~ ( aElementOf0 @ A @ szNzAzT0 ) ),
inference(lifteq,[status(thm)],[483]) ).
thf(48,axiom,
aElementOf0 @ xK @ szNzAzT0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3418) ).
thf(318,plain,
aElementOf0 @ xK @ szNzAzT0,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[48]) ).
thf(484,plain,
! [A: $i] :
( ~ ( aElementOf0 @ A @ szNzAzT0 )
| ( A = sz00 )
| ( aElementOf0 @ ( sk39 @ A ) @ szNzAzT0 ) ),
inference(cnf,[status(esa)],[482]) ).
thf(486,plain,
! [A: $i] :
( ( A = sz00 )
| ~ ( aElementOf0 @ A @ szNzAzT0 )
| ( aElementOf0 @ ( sk39 @ A ) @ szNzAzT0 ) ),
inference(lifteq,[status(thm)],[484]) ).
thf(767,plain,
! [A: $i] :
( ( A = sz00 )
| ( aElementOf0 @ ( sk39 @ A ) @ szNzAzT0 )
| ( ( aElementOf0 @ xK @ szNzAzT0 )
!= ( aElementOf0 @ A @ szNzAzT0 ) ) ),
inference(paramod_ordered,[status(thm)],[318,486]) ).
thf(768,plain,
( ( sz00 = xK )
| ( aElementOf0 @ ( sk39 @ xK ) @ szNzAzT0 ) ),
inference(pattern_uni,[status(thm)],[767:[bind(A,$thf( xK ))]]) ).
thf(62,axiom,
xK != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3462) ).
thf(428,plain,
xK != sz00,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[62]) ).
thf(429,plain,
xK != sz00,
inference(polarity_switch,[status(thm)],[428]) ).
thf(430,plain,
sz00 != xK,
inference(lifteq,[status(thm)],[429]) ).
thf(846,plain,
aElementOf0 @ ( sk39 @ xK ) @ szNzAzT0,
inference(simplifyReflect,[status(thm)],[768,430]) ).
thf(1,conjecture,
? [A: $i] :
( ( aElementOf0 @ A @ szNzAzT0 )
& ( ( szszuzczcdt0 @ A )
= xK ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
( ( aElementOf0 @ A @ szNzAzT0 )
& ( ( szszuzczcdt0 @ A )
= xK ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(82,plain,
~ ? [A: $i] :
( ( aElementOf0 @ A @ szNzAzT0 )
& ( ( szszuzczcdt0 @ A )
= xK ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(83,plain,
! [A: $i] :
( ~ ( aElementOf0 @ A @ szNzAzT0 )
| ( ( szszuzczcdt0 @ A )
!= xK ) ),
inference(cnf,[status(esa)],[82]) ).
thf(84,plain,
! [A: $i] :
( ( ( szszuzczcdt0 @ A )
!= xK )
| ~ ( aElementOf0 @ A @ szNzAzT0 ) ),
inference(lifteq,[status(thm)],[83]) ).
thf(849,plain,
! [A: $i] :
( ( ( szszuzczcdt0 @ A )
!= xK )
| ( ( aElementOf0 @ ( sk39 @ xK ) @ szNzAzT0 )
!= ( aElementOf0 @ A @ szNzAzT0 ) ) ),
inference(paramod_ordered,[status(thm)],[846,84]) ).
thf(850,plain,
( ( szszuzczcdt0 @ ( sk39 @ xK ) )
!= xK ),
inference(pattern_uni,[status(thm)],[849:[bind(A,$thf( sk39 @ xK ))]]) ).
thf(280459,plain,
! [A: $i] :
( ( A = sz00 )
| ~ ( aElementOf0 @ A @ szNzAzT0 )
| ( A != xK )
| ( ( szszuzczcdt0 @ ( sk39 @ A ) )
!= ( szszuzczcdt0 @ ( sk39 @ xK ) ) ) ),
inference(paramod_ordered,[status(thm)],[485,850]) ).
thf(280460,plain,
( ( sz00 = xK )
| ~ ( aElementOf0 @ xK @ szNzAzT0 )
| ( xK != xK ) ),
inference(pattern_uni,[status(thm)],[280459:[bind(A,$thf( xK ))]]) ).
thf(280959,plain,
( ( sz00 = xK )
| ~ ( aElementOf0 @ xK @ szNzAzT0 ) ),
inference(simp,[status(thm)],[280460]) ).
thf(280981,plain,
( ( sz00 = xK )
| ~ $true ),
inference(rewrite,[status(thm)],[280959,318]) ).
thf(280982,plain,
sz00 = xK,
inference(simp,[status(thm)],[280981]) ).
thf(280983,plain,
$false,
inference(simplifyReflect,[status(thm)],[280982,430]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : NUM568+3 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.11 % Command : run_Leo-III %s %d THM
% 0.10/0.32 % Computer : n023.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sun Jun 23 01:51:25 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.95/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.34/1.01 % [INFO] Parsing done (149ms).
% 1.34/1.02 % [INFO] Running in sequential loop mode.
% 2.06/1.44 % [INFO] eprover registered as external prover.
% 2.06/1.44 % [INFO] Scanning for conjecture ...
% 2.15/1.50 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.15/1.51 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.15/1.52 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.15/1.53 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.34/1.54 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.34/1.55 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.34/1.55 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.34/1.56 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.34/1.56 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.34/1.57 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.45/1.57 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.45/1.59 % [INFO] Found a conjecture (or negated_conjecture) and 79 axioms. Running axiom selection ...
% 2.66/1.66 % [INFO] Axiom selection finished. Selected 79 axioms (removed 0 axioms).
% 2.74/1.69 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.72 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.72 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.72 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.72 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.72 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.73 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.73 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.73 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.73 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.74 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.74/1.74 % [INFO] Problem is first-order (TPTP FOF).
% 2.97/1.75 % [INFO] Type checking passed.
% 2.97/1.76 % [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 ...
% 158.66/90.21 % [INFO] Killing All external provers ...
% 158.66/90.21 % Time passed: 89674ms (effective reasoning time: 89187ms)
% 158.66/90.21 % 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)>
% 158.66/90.21 % Axioms used in derivation (3): mNatExtra, m__3418, m__3462
% 158.66/90.21 % No. of inferences in proof: 28
% 158.66/90.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 89674 ms resp. 89187 ms w/o parsing
% 158.71/90.23 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 158.71/90.23 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------