TSTP Solution File: SEV214^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEV214^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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 04:11:08 EDT 2024
% Result : Theorem 14.58s 4.20s
% Output : Refutation 14.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 186 ( 185 equ; 12 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 350 ( 50 ~; 94 |; 24 &; 166 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 9 con; 0-2 aty)
% Number of variables : 87 ( 12 ^ 42 !; 33 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
thf(iS_type,type,
iS: $tType ).
thf(c0_type,type,
c0: iS ).
thf(cP_type,type,
cP: iS > iS > iS ).
thf(sk5_type,type,
sk5: iS ).
thf(sk6_type,type,
sk6: iS ).
thf(sk18_type,type,
sk18: iS ).
thf(sk19_type,type,
sk19: iS ).
thf(sk20_type,type,
sk20: iS ).
thf(sk21_type,type,
sk21: iS ).
thf(1,conjecture,
( ( ! [A: iS,B: iS] :
( ( cP @ A @ B )
!= c0 )
& ! [A: iS,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: iS > $o] :
( ( ( A @ c0 )
& ! [B: iS,C: iS] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: iS] : ( A @ B ) ) )
=> ( ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ A @ B ) ) ) )
= ( (=) @ iS @ c0 ) )
& ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ B @ A ) ) ) )
= ( (=) @ iS @ c0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_T_LR_LEM2_pme) ).
thf(2,negated_conjecture,
~ ( ( ! [A: iS,B: iS] :
( ( cP @ A @ B )
!= c0 )
& ! [A: iS,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: iS > $o] :
( ( ( A @ c0 )
& ! [B: iS,C: iS] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: iS] : ( A @ B ) ) )
=> ( ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ A @ B ) ) ) )
= ( (=) @ iS @ c0 ) )
& ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ B @ A ) ) ) )
= ( (=) @ iS @ c0 ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: iS,B: iS] :
( ( cP @ A @ B )
!= c0 )
& ! [A: iS,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: iS > $o] :
( ( ( A @ c0 )
& ! [B: iS,C: iS] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: iS] : ( A @ B ) ) )
=> ( ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ A @ B ) ) ) )
= ( (=) @ iS @ c0 ) )
& ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ B @ A ) ) ) )
= ( (=) @ iS @ c0 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ( ~ ? [A: iS,B: iS] :
( ( cP @ A @ B )
= c0 )
& ! [A: iS,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: iS > $o] :
( ( ( A @ c0 )
& ! [B: iS,C: iS] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: iS] : ( A @ B ) ) )
=> ( ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ A @ B ) ) ) )
= ( (=) @ iS @ c0 ) )
& ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ B @ A ) ) ) )
= ( (=) @ iS @ c0 ) ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(6,plain,
( ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ A @ B ) ) ) )
!= ( (=) @ iS @ c0 ) )
| ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ B @ A ) ) ) )
!= ( (=) @ iS @ c0 ) ) ),
inference(cnf,[status(esa)],[4]) ).
thf(23,plain,
( ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ A @ B ) ) ) )
!= ( (=) @ iS @ c0 ) )
| ( ( ^ [A: iS] :
( ( A = c0 )
| ? [B: iS] :
( c0
= ( cP @ B @ A ) ) ) )
!= ( (=) @ iS @ c0 ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(53,plain,
( ( ( ( sk5 = c0 )
| ? [A: iS] :
( c0
= ( cP @ sk5 @ A ) ) )
!= ( c0 = sk5 ) )
| ( ( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) )
!= ( c0 = sk6 ) ) ),
inference(func_ext,[status(esa)],[23]) ).
thf(561,plain,
( ( sk5 = c0 )
| ? [A: iS] :
( c0
= ( cP @ sk5 @ A ) )
| ( c0 = sk5 )
| ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) )
| ( c0 = sk6 ) ),
inference(bool_ext,[status(thm)],[53]) ).
thf(627,plain,
( ( sk5 = c0 )
| ( sk6 = c0 )
| ( sk5 = c0 )
| ? [A: iS] :
( c0
= ( cP @ sk5 @ A ) )
| ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) ),
inference(lifteq,[status(thm)],[561]) ).
thf(678,plain,
( ( sk6 = c0 )
| ( c0
= ( cP @ sk20 @ sk6 ) )
| ( sk5 = c0 )
| ( c0
= ( cP @ sk5 @ sk19 ) )
| ( sk6 = c0 )
| ( sk5 = c0 ) ),
inference(cnf,[status(esa)],[627]) ).
thf(679,plain,
( ( sk6 = c0 )
| ( ( cP @ sk20 @ sk6 )
= c0 )
| ( sk5 = c0 )
| ( ( cP @ sk5 @ sk19 )
= c0 )
| ( sk6 = c0 )
| ( sk5 = c0 ) ),
inference(lifteq,[status(thm)],[678]) ).
thf(680,plain,
( ( sk6 = c0 )
| ( ( cP @ sk20 @ sk6 )
= c0 )
| ( sk5 = c0 )
| ( ( cP @ sk5 @ sk19 )
= c0 ) ),
inference(simp,[status(thm)],[679]) ).
thf(7,plain,
! [B: iS,A: iS] :
( ( cP @ A @ B )
!= c0 ),
inference(cnf,[status(esa)],[4]) ).
thf(29,plain,
! [B: iS,A: iS] :
( ( cP @ A @ B )
!= c0 ),
inference(lifteq,[status(thm)],[7]) ).
thf(697,plain,
( ( sk6 = c0 )
| ( sk5 = c0 ) ),
inference(simplifyReflect,[status(thm)],[680,29]) ).
thf(559,plain,
( ( sk5 = c0 )
| ? [A: iS] :
( c0
= ( cP @ sk5 @ A ) )
| ( c0 = sk5 )
| ~ ( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) )
| ( c0 != sk6 ) ),
inference(bool_ext,[status(thm)],[53]) ).
thf(606,plain,
( ( sk5 = c0 )
| ( sk6 != c0 )
| ( sk5 = c0 )
| ? [A: iS] :
( c0
= ( cP @ sk5 @ A ) )
| ~ ( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) ) ),
inference(lifteq,[status(thm)],[559]) ).
thf(668,plain,
( ( sk6 != c0 )
| ( sk5 = c0 )
| ( c0
= ( cP @ sk5 @ sk18 ) )
| ( sk6 != c0 )
| ( sk5 = c0 ) ),
inference(cnf,[status(esa)],[606]) ).
thf(671,plain,
( ( sk6 != c0 )
| ( sk5 = c0 )
| ( ( cP @ sk5 @ sk18 )
= c0 )
| ( sk6 != c0 )
| ( sk5 = c0 ) ),
inference(lifteq,[status(thm)],[668]) ).
thf(672,plain,
( ( sk6 != c0 )
| ( sk5 = c0 )
| ( ( cP @ sk5 @ sk18 )
= c0 ) ),
inference(simp,[status(thm)],[671]) ).
thf(705,plain,
( ( sk6 != c0 )
| ( sk5 = c0 ) ),
inference(simplifyReflect,[status(thm)],[672,29]) ).
thf(706,plain,
( ( sk5 = c0 )
| ( sk6 != sk6 ) ),
inference(paramod_ordered,[status(thm)],[697,705]) ).
thf(707,plain,
sk5 = c0,
inference(pattern_uni,[status(thm)],[706:[]]) ).
thf(708,plain,
( ( ( ( c0 = c0 )
| ? [A: iS] :
( c0
= ( cP @ c0 @ A ) ) )
!= ( c0 = c0 ) )
| ( ( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) )
!= ( c0 = sk6 ) ) ),
inference(rewrite,[status(thm)],[53,707]) ).
thf(709,plain,
( ( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) )
!= ( c0 = sk6 ) ),
inference(simp,[status(thm)],[708]) ).
thf(715,plain,
( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) )
| ( c0 = sk6 ) ),
inference(bool_ext,[status(thm)],[709]) ).
thf(738,plain,
( ( sk6 = c0 )
| ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) ),
inference(lifteq,[status(thm)],[715]) ).
thf(760,plain,
( ( sk6 = c0 )
| ( c0
= ( cP @ sk21 @ sk6 ) )
| ( sk6 = c0 ) ),
inference(cnf,[status(esa)],[738]) ).
thf(761,plain,
( ( sk6 = c0 )
| ( ( cP @ sk21 @ sk6 )
= c0 )
| ( sk6 = c0 ) ),
inference(lifteq,[status(thm)],[760]) ).
thf(762,plain,
( ( sk6 = c0 )
| ( ( cP @ sk21 @ sk6 )
= c0 ) ),
inference(simp,[status(thm)],[761]) ).
thf(558,plain,
( ~ ( ( sk5 = c0 )
| ? [A: iS] :
( c0
= ( cP @ sk5 @ A ) ) )
| ( c0 != sk5 )
| ~ ( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) )
| ( c0 != sk6 ) ),
inference(bool_ext,[status(thm)],[53]) ).
thf(632,plain,
( ( sk5 != c0 )
| ( sk6 != c0 )
| ~ ( ( sk5 = c0 )
| ? [A: iS] :
( c0
= ( cP @ sk5 @ A ) ) )
| ~ ( ( sk6 = c0 )
| ? [A: iS] :
( c0
= ( cP @ A @ sk6 ) ) ) ),
inference(lifteq,[status(thm)],[558]) ).
thf(684,plain,
( ( sk6 != c0 )
| ( sk5 != c0 )
| ( sk6 != c0 )
| ( sk5 != c0 ) ),
inference(cnf,[status(esa)],[632]) ).
thf(689,plain,
( ( sk6 != c0 )
| ( sk5 != c0 )
| ( sk6 != c0 )
| ( sk5 != c0 ) ),
inference(lifteq,[status(thm)],[684]) ).
thf(690,plain,
( ( sk6 != c0 )
| ( sk5 != c0 ) ),
inference(simp,[status(thm)],[689]) ).
thf(710,plain,
( ( sk6 != c0 )
| ( c0 != c0 ) ),
inference(rewrite,[status(thm)],[690,707]) ).
thf(711,plain,
sk6 != c0,
inference(simp,[status(thm)],[710]) ).
thf(774,plain,
$false,
inference(simplifyReflect,[status(thm)],[762,711,29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV214^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.14 % Command : run_Leo-III %s %d
% 0.13/0.34 % Computer : n017.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 : Sun May 19 19:17:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 1.12/1.07 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.48/1.25 % [INFO] Parsing done (177ms).
% 1.57/1.27 % [INFO] Running in sequential loop mode.
% 2.11/1.66 % [INFO] nitpick registered as external prover.
% 2.11/1.67 % [INFO] Scanning for conjecture ...
% 2.36/1.78 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.46/1.83 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.46/1.83 % [INFO] Problem is higher-order (TPTP THF).
% 2.46/1.83 % [INFO] Type checking passed.
% 2.46/1.84 % [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 ...
% 14.58/4.18 % [INFO] Killing All external provers ...
% 14.58/4.19 % Time passed: 3665ms (effective reasoning time: 2908ms)
% 14.58/4.19 % 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)>
% 14.58/4.20 % Axioms used in derivation (0):
% 14.58/4.20 % No. of inferences in proof: 38
% 14.58/4.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3665 ms resp. 2908 ms w/o parsing
% 14.82/4.30 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.82/4.30 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------