TSTP Solution File: SET587^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SET587^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n007.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:06:20 EDT 2024
% Result : Theorem 13.43s 3.44s
% Output : Refutation 13.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 157 ( 26 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 268 ( 68 ~; 46 |; 21 &; 124 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 32 ^ 29 !; 0 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk3_type,type,
sk3: a ).
thf(sk4_type,type,
sk4: a ).
thf(sk6_type,type,
sk6: a ).
thf(1,conjecture,
! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
& ~ ( B @ C ) ) )
= ( ^ [C: a] : $false ) )
= ( ! [C: a] :
( ( A @ C )
=> ( B @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_45_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
& ~ ( B @ C ) ) )
= ( ^ [C: a] : $false ) )
= ( ! [C: a] :
( ( A @ C )
=> ( B @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
& ~ ( B @ C ) ) )
= ( ^ [C: a] : $false ) )
= ( ! [C: a] :
( ( A @ C )
=> ( B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
= ( ^ [A: a] : $false ) )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
= ( ^ [A: a] : $false ) )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
= ( ^ [A: a] : $false ) )
| ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
= ( ^ [A: a] : $false ) )
| ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(12,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A )
| ( ( ^ [B: a] :
( ( sk1 @ B )
& ~ ( sk2 @ B ) ) )
= ( ^ [B: a] : $false ) ) ),
inference(cnf,[status(esa)],[9]) ).
thf(6,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
!= ( ^ [A: a] : $false ) )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
!= ( ^ [A: a] : $false ) )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(10,plain,
( ~ ( sk2 @ sk3 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
!= ( ^ [A: a] : $false ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(26,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A )
| ~ ( sk2 @ sk3 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
& ~ ( sk2 @ B ) ) )
!= ( ^ [B: a] :
( ( sk1 @ B )
& ~ ( sk2 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[12,10]) ).
thf(27,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A )
| ~ ( sk2 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[26:[]]) ).
thf(13,plain,
( ( ( sk1 @ sk4 )
& ~ ( sk2 @ sk4 ) )
| ~ ( sk2 @ sk3 ) ),
inference(func_ext,[status(esa)],[10]) ).
thf(14,plain,
( ~ ( sk2 @ sk3 )
| ~ ( sk2 @ sk4 ) ),
inference(cnf,[status(esa)],[13]) ).
thf(38,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ~ ( sk2 @ sk3 )
| ( ( sk2 @ A )
!= ( sk2 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[27,14]) ).
thf(39,plain,
( ~ ( sk1 @ sk4 )
| ~ ( sk2 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[38:[bind(A,$thf( sk4 ))]]) ).
thf(11,plain,
( ( sk1 @ sk3 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
!= ( ^ [A: a] : $false ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(31,plain,
( ( ( sk1 @ sk6 )
& ~ ( sk2 @ sk6 ) )
| ( sk1 @ sk3 ) ),
inference(func_ext,[status(esa)],[11]) ).
thf(35,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk6 ) ),
inference(cnf,[status(esa)],[31]) ).
thf(50,plain,
! [A: a] :
( ( sk1 @ sk3 )
| ( sk2 @ A )
| ( ( ^ [B: a] :
( ( sk1 @ B )
& ~ ( sk2 @ B ) ) )
= ( ^ [B: a] : $false ) )
| ( ( sk1 @ sk6 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[35,12]) ).
thf(51,plain,
( ( sk1 @ sk3 )
| ( sk2 @ sk6 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
= ( ^ [A: a] : $false ) ) ),
inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( sk6 ))]]) ).
thf(75,plain,
( ( sk1 @ sk3 )
| ( sk2 @ sk6 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[51,11]) ).
thf(76,plain,
( ( sk1 @ sk3 )
| ( sk2 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[75:[]]) ).
thf(34,plain,
( ( sk1 @ sk3 )
| ~ ( sk2 @ sk6 ) ),
inference(cnf,[status(esa)],[31]) ).
thf(92,plain,
( ( sk1 @ sk3 )
| ( ( sk2 @ sk6 )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[76,34]) ).
thf(93,plain,
sk1 @ sk3,
inference(pattern_uni,[status(thm)],[92:[]]) ).
thf(23,plain,
! [B: a,A: a] :
( ~ ( ( sk1 @ B )
& ~ ( sk2 @ B ) )
| ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(func_ext,[status(esa)],[12]) ).
thf(28,plain,
! [B: a,A: a] :
( ( sk2 @ A )
| ~ ( sk1 @ A )
| ~ ( sk1 @ B )
| ( sk2 @ B ) ),
inference(cnf,[status(esa)],[23]) ).
thf(161,plain,
! [B: a,A: a] :
( ( sk2 @ A )
| ~ ( sk1 @ A )
| ~ ( sk1 @ B )
| ( ( sk2 @ B )
!= ( sk2 @ A ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[28]) ).
thf(162,plain,
! [A: a] :
( ( sk2 @ A )
| ~ ( sk1 @ A )
| ~ ( sk1 @ A ) ),
inference(pattern_uni,[status(thm)],[161:[bind(A,$thf( B ))]]) ).
thf(172,plain,
! [A: a] :
( ( sk2 @ A )
| ~ ( sk1 @ A ) ),
inference(simp,[status(thm)],[162]) ).
thf(1365,plain,
! [A: a] :
( ( sk2 @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[93,172]) ).
thf(1366,plain,
sk2 @ sk3,
inference(pattern_uni,[status(thm)],[1365:[bind(A,$thf( sk3 ))]]) ).
thf(1421,plain,
( ~ ( sk1 @ sk4 )
| ~ $true ),
inference(rewrite,[status(thm)],[39,1366]) ).
thf(1422,plain,
~ ( sk1 @ sk4 ),
inference(simp,[status(thm)],[1421]) ).
thf(15,plain,
( ~ ( sk2 @ sk3 )
| ( sk1 @ sk4 ) ),
inference(cnf,[status(esa)],[13]) ).
thf(1423,plain,
( ~ $true
| ( sk1 @ sk4 ) ),
inference(rewrite,[status(thm)],[15,1366]) ).
thf(1424,plain,
sk1 @ sk4,
inference(simp,[status(thm)],[1423]) ).
thf(1450,plain,
~ $true,
inference(rewrite,[status(thm)],[1422,1424]) ).
thf(1451,plain,
$false,
inference(simp,[status(thm)],[1450]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SET587^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.13 % Command : run_Leo-III %s %d
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 13:02:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.78/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.10/0.94 % [INFO] Parsing done (104ms).
% 1.10/0.95 % [INFO] Running in sequential loop mode.
% 1.49/1.19 % [INFO] nitpick registered as external prover.
% 1.49/1.20 % [INFO] Scanning for conjecture ...
% 1.64/1.26 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.64/1.29 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.64/1.29 % [INFO] Problem is higher-order (TPTP THF).
% 1.64/1.29 % [INFO] Type checking passed.
% 1.64/1.30 % [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 ...
% 13.43/3.43 % [INFO] Killing All external provers ...
% 13.43/3.44 % Time passed: 2944ms (effective reasoning time: 2473ms)
% 13.43/3.44 % 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)>
% 13.43/3.44 % Axioms used in derivation (0):
% 13.43/3.44 % No. of inferences in proof: 41
% 13.43/3.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2944 ms resp. 2473 ms w/o parsing
% 13.43/3.53 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.43/3.53 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------