TSTP Solution File: SEV197^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV197^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n021.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:44 EDT 2024
% Result : Theorem 69.93s 11.01s
% Output : Refutation 69.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 104 ( 103 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 335 ( 49 ~; 34 |; 28 &; 204 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 120 ( 0 ^ 116 !; 4 ?; 120 :)
% Comments :
%------------------------------------------------------------------------------
thf(iS_type,type,
iS: $tType ).
thf(c0_type,type,
c0: iS ).
thf(cP_type,type,
cP: iS > iS > iS ).
thf(sk3_type,type,
sk3: iS ).
thf(sk4_type,type,
sk4: iS ).
thf(sk5_type,type,
sk5: iS ).
thf(sk6_type,type,
sk6: iS ).
thf(sk7_type,type,
sk7: iS ).
thf(sk8_type,type,
sk8: iS ).
thf(sk9_type,type,
sk9: iS > iS > iS ).
thf(sk10_type,type,
sk10: iS > iS > 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,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: iS,B: iS] :
( ( cP @ A @ B )
!= c0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cS_ALG02_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,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: iS,B: iS] :
( ( cP @ A @ B )
!= 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,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: iS,B: iS] :
( ( cP @ A @ B )
!= 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,B: iS,C: iS,D: iS] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ~ ? [A: iS,B: iS] :
( ( cP @ A @ B )
= c0 ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(6,plain,
( ( ( cP @ sk3 @ sk5 )
= ( cP @ sk4 @ sk6 ) )
| ( ( cP @ sk7 @ sk8 )
= c0 ) ),
inference(cnf,[status(esa)],[4]) ).
thf(20,plain,
( ( ( cP @ sk4 @ sk6 )
= ( cP @ sk3 @ sk5 ) )
| ( ( cP @ sk7 @ sk8 )
= c0 ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(8,plain,
! [B: iS,A: iS] :
( ( cP @ A @ B )
!= c0 ),
inference(cnf,[status(esa)],[4]) ).
thf(31,plain,
! [B: iS,A: iS] :
( ( cP @ A @ B )
!= c0 ),
inference(lifteq,[status(thm)],[8]) ).
thf(191,plain,
( ( cP @ sk4 @ sk6 )
= ( cP @ sk3 @ sk5 ) ),
inference(simplifyReflect,[status(thm)],[20,31]) ).
thf(7,plain,
! [D: iS,C: iS,B: iS,A: iS] :
( ( ( cP @ A @ C )
!= ( cP @ B @ D ) )
| ( C = D ) ),
inference(cnf,[status(esa)],[4]) ).
thf(25,plain,
! [D: iS,C: iS,B: iS,A: iS] :
( ( ( cP @ A @ C )
!= ( cP @ B @ D ) )
| ( C = D ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(26,plain,
! [D: iS,C: iS,B: iS,A: iS] :
( ( ( cP @ A @ C )
!= ( cP @ B @ D ) )
| ( C = D ) ),
inference(simp,[status(thm)],[25]) ).
thf(1013,plain,
! [D: iS,C: iS,B: iS,A: iS] :
( ( ( cP @ sk3 @ sk5 )
!= ( cP @ B @ D ) )
| ( C = D )
| ( ( cP @ sk4 @ sk6 )
!= ( cP @ A @ C ) ) ),
inference(paramod_ordered,[status(thm)],[191,26]) ).
thf(1014,plain,
! [B: iS,A: iS] :
( ( ( cP @ sk3 @ sk5 )
!= ( cP @ A @ B ) )
| ( sk6 = B ) ),
inference(pattern_uni,[status(thm)],[1013:[bind(A,$thf( sk4 )),bind(B,$thf( B )),bind(C,$thf( sk6 ))]]) ).
thf(1017,plain,
! [B: iS,A: iS] :
( ( ( cP @ sk3 @ sk5 )
!= ( cP @ A @ B ) )
| ( sk6 = B ) ),
inference(simp,[status(thm)],[1014]) ).
thf(9702,plain,
sk6 = sk5,
inference(pattern_uni,[status(thm)],[1017:[bind(A,$thf( sk3 )),bind(B,$thf( sk5 ))]]) ).
thf(11,plain,
! [D: iS,C: iS,B: iS,A: iS] :
( ( ( cP @ A @ C )
!= ( cP @ B @ D ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[4]) ).
thf(28,plain,
! [D: iS,C: iS,B: iS,A: iS] :
( ( ( cP @ A @ C )
!= ( cP @ B @ D ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(29,plain,
! [D: iS,C: iS,B: iS,A: iS] :
( ( ( cP @ A @ C )
!= ( cP @ B @ D ) )
| ( A = B ) ),
inference(simp,[status(thm)],[28]) ).
thf(30,plain,
! [B: iS,A: iS] :
( ( sk10 @ A @ ( cP @ B @ A ) )
= B ),
introduced(tautology,[new_symbols(inverse(cP),[sk10])]) ).
thf(199,plain,
! [B: iS,A: iS] :
( ( ( sk10 @ A @ ( cP @ sk3 @ sk5 ) )
= B )
| ( ( cP @ sk4 @ sk6 )
!= ( cP @ B @ A ) ) ),
inference(paramod_ordered,[status(thm)],[191,30]) ).
thf(200,plain,
( ( sk10 @ sk6 @ ( cP @ sk3 @ sk5 ) )
= sk4 ),
inference(pattern_uni,[status(thm)],[199:[bind(A,$thf( sk6 )),bind(B,$thf( sk4 ))]]) ).
thf(215,plain,
! [B: iS,A: iS] :
( ( sk4 = B )
| ( ( sk10 @ sk6 @ ( cP @ sk3 @ sk5 ) )
!= ( sk10 @ A @ ( cP @ B @ A ) ) ) ),
inference(paramod_ordered,[status(thm)],[200,30]) ).
thf(218,plain,
! [B: iS,A: iS] :
( ( sk4 = B )
| ( sk6 != A )
| ( ( cP @ sk3 @ sk5 )
!= ( cP @ B @ A ) ) ),
inference(simp,[status(thm)],[215]) ).
thf(221,plain,
! [A: iS] :
( ( sk4 = A )
| ( ( cP @ sk3 @ sk5 )
!= ( cP @ A @ sk6 ) ) ),
inference(simp,[status(thm)],[218]) ).
thf(1191,plain,
! [A: iS] :
( ( sk4 = A )
| ( sk3 != A )
| ( sk6 != sk5 ) ),
inference(simp,[status(thm)],[221]) ).
thf(1198,plain,
( ( sk4 = sk3 )
| ( sk6 != sk5 ) ),
inference(simp,[status(thm)],[1191]) ).
thf(27,plain,
! [B: iS,A: iS] :
( ( sk9 @ A @ ( cP @ A @ B ) )
= B ),
introduced(tautology,[new_symbols(inverse(cP),[sk9])]) ).
thf(201,plain,
! [B: iS,A: iS] :
( ( ( sk9 @ A @ ( cP @ sk3 @ sk5 ) )
= B )
| ( ( cP @ sk4 @ sk6 )
!= ( cP @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[191,27]) ).
thf(202,plain,
( ( sk9 @ sk4 @ ( cP @ sk3 @ sk5 ) )
= sk6 ),
inference(pattern_uni,[status(thm)],[201:[bind(A,$thf( sk4 )),bind(B,$thf( sk6 ))]]) ).
thf(285,plain,
! [B: iS,A: iS] :
( ( B = sk6 )
| ( ( sk9 @ A @ ( cP @ A @ B ) )
!= ( sk9 @ sk4 @ ( cP @ sk3 @ sk5 ) ) ) ),
inference(paramod_ordered,[status(thm)],[27,202]) ).
thf(288,plain,
! [B: iS,A: iS] :
( ( B = sk6 )
| ( A != sk4 )
| ( ( cP @ A @ B )
!= ( cP @ sk3 @ sk5 ) ) ),
inference(simp,[status(thm)],[285]) ).
thf(289,plain,
! [A: iS] :
( ( A = sk6 )
| ( ( cP @ sk4 @ A )
!= ( cP @ sk3 @ sk5 ) ) ),
inference(simp,[status(thm)],[288]) ).
thf(1209,plain,
! [A: iS] :
( ( A = sk6 )
| ( sk4 != sk3 )
| ( A != sk5 ) ),
inference(simp,[status(thm)],[289]) ).
thf(1212,plain,
( ( sk6 = sk5 )
| ( sk4 != sk3 ) ),
inference(simp,[status(thm)],[1209]) ).
thf(5,plain,
( ( sk3 != sk4 )
| ( sk5 != sk6 )
| ( ( cP @ sk7 @ sk8 )
= c0 ) ),
inference(cnf,[status(esa)],[4]) ).
thf(16,plain,
( ( sk4 != sk3 )
| ( sk6 != sk5 )
| ( ( cP @ sk7 @ sk8 )
= c0 ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(55,plain,
( ( sk4 != sk3 )
| ( sk6 != sk5 ) ),
inference(simplifyReflect,[status(thm)],[16,31]) ).
thf(1221,plain,
( ( sk4 != sk3 )
| ( sk6 != sk6 ) ),
inference(paramod_ordered,[status(thm)],[1212,55]) ).
thf(1222,plain,
sk4 != sk3,
inference(pattern_uni,[status(thm)],[1221:[]]) ).
thf(1223,plain,
sk6 != sk5,
inference(simplifyReflect,[status(thm)],[1198,1222]) ).
thf(9712,plain,
$false,
inference(simplifyReflect,[status(thm)],[9702,1223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV197^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13 % Command : run_Leo-III %s %d SAT
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 18:35:40 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.97/0.91 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.15/1.03 % [INFO] Parsing done (114ms).
% 1.36/1.04 % [INFO] Running in sequential loop mode.
% 1.78/1.25 % [INFO] nitpick registered as external prover.
% 1.78/1.25 % [INFO] Scanning for conjecture ...
% 1.78/1.32 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.97/1.34 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.97/1.34 % [INFO] Problem is higher-order (TPTP THF).
% 1.97/1.34 % [INFO] Type checking passed.
% 1.97/1.35 % [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 ...
% 69.93/11.00 % [INFO] Killing All external provers ...
% 69.93/11.01 % Time passed: 10483ms (effective reasoning time: 9966ms)
% 69.93/11.01 % 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)>
% 69.93/11.01 % Axioms used in derivation (0):
% 69.93/11.01 % No. of inferences in proof: 42
% 69.93/11.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 10483 ms resp. 9966 ms w/o parsing
% 69.93/11.04 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 69.93/11.04 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------