TSTP Solution File: SEV200^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV200^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n027.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 5.86s 2.23s
% Output : Refutation 5.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 48 equ; 0 cnn)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 231 ( 13 ~; 12 |; 46 &; 136 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 13 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-3 aty)
% Number of variables : 87 ( 0 ^ 61 !; 26 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(x_type,type,
x: a ).
thf(cZ_type,type,
cZ: a ).
thf(cP_type,type,
cP: a > a > a ).
thf(sk3_type,type,
sk3: a > a > a > $o ).
thf(1,conjecture,
( ( ! [A: a,B: a] :
( ( cP @ A @ B )
!= cZ )
& ! [A: a,B: a,C: a,D: a] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: a > $o] :
( ( ( A @ cZ )
& ! [B: a,C: a] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: a] : ( A @ B ) ) )
=> ! [A: a > a > a > $o] :
( ( $true
& ! [B: a,C: a,D: a] :
( ( ( ( B = cZ )
& ( C = D ) )
| ( ( C = cZ )
& ( B = D ) )
| ? [E: a,F: a,G: a,H: a,I: a,J: a] :
( ( B
= ( cP @ E @ F ) )
& ( C
= ( cP @ G @ H ) )
& ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) )
=> ( A @ B @ C @ D ) ) )
=> ( A @ cZ @ x @ x ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_LEM1C_pme) ).
thf(2,negated_conjecture,
~ ( ( ! [A: a,B: a] :
( ( cP @ A @ B )
!= cZ )
& ! [A: a,B: a,C: a,D: a] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: a > $o] :
( ( ( A @ cZ )
& ! [B: a,C: a] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: a] : ( A @ B ) ) )
=> ! [A: a > a > a > $o] :
( ( $true
& ! [B: a,C: a,D: a] :
( ( ( ( B = cZ )
& ( C = D ) )
| ( ( C = cZ )
& ( B = D ) )
| ? [E: a,F: a,G: a,H: a,I: a,J: a] :
( ( B
= ( cP @ E @ F ) )
& ( C
= ( cP @ G @ H ) )
& ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) )
=> ( A @ B @ C @ D ) ) )
=> ( A @ cZ @ x @ x ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: a,B: a] :
( ( cP @ A @ B )
!= cZ )
& ! [A: a,B: a,C: a,D: a] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: a > $o] :
( ( ( A @ cZ )
& ! [B: a,C: a] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: a] : ( A @ B ) ) )
=> ! [A: a > a > a > $o] :
( ! [B: a,C: a,D: a] :
( ( ( ( B = cZ )
& ( C = D ) )
| ( ( C = cZ )
& ( B = D ) )
| ? [E: a,F: a,G: a,H: a,I: a,J: a] :
( ( B
= ( cP @ E @ F ) )
& ( C
= ( cP @ G @ H ) )
& ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) )
=> ( A @ B @ C @ D ) )
=> ( A @ cZ @ x @ x ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ( ~ ? [A: a,B: a] :
( ( cP @ A @ B )
= cZ )
& ! [A: a,B: a,C: a,D: a] :
( ( ( cP @ A @ C )
= ( cP @ B @ D ) )
=> ( ( A = B )
& ( C = D ) ) )
& ! [A: a > $o] :
( ( ( A @ cZ )
& ! [B: a,C: a] :
( ( ( A @ B )
& ( A @ C ) )
=> ( A @ ( cP @ B @ C ) ) ) )
=> ! [B: a] : ( A @ B ) ) )
=> ! [A: a > a > a > $o] :
( ! [B: a,C: a,D: a] :
( ( ( ( B = cZ )
& ( C = D ) )
| ( ( C = cZ )
& ( B = D ) )
| ? [E: a,F: a] :
( ( B
= ( cP @ E @ F ) )
& ? [G: a,H: a] :
( ( C
= ( cP @ G @ H ) )
& ? [I: a,J: a] :
( ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) ) ) )
=> ( A @ B @ C @ D ) )
=> ( A @ cZ @ x @ x ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(11,plain,
~ ( sk3 @ cZ @ x @ x ),
inference(cnf,[status(esa)],[4]) ).
thf(8,plain,
! [C: a,B: a,A: a] :
( ( A != cZ )
| ( B != C )
| ( sk3 @ A @ B @ C ) ),
inference(cnf,[status(esa)],[4]) ).
thf(36,plain,
! [C: a,B: a,A: a] :
( ( A != cZ )
| ( B != C )
| ( sk3 @ A @ B @ C ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(37,plain,
! [A: a] : ( sk3 @ cZ @ A @ A ),
inference(simp,[status(thm)],[36]) ).
thf(252,plain,
~ $true,
inference(rewrite,[status(thm)],[11,37]) ).
thf(253,plain,
$false,
inference(simp,[status(thm)],[252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEV200^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.11 % Command : run_Leo-III %s %d SAT
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri Jun 21 18:39:25 EDT 2024
% 0.12/0.32 % CPUTime :
% 1.01/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.27/1.02 % [INFO] Parsing done (111ms).
% 1.27/1.03 % [INFO] Running in sequential loop mode.
% 1.67/1.22 % [INFO] nitpick registered as external prover.
% 1.67/1.23 % [INFO] Scanning for conjecture ...
% 1.81/1.30 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.81/1.33 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.81/1.33 % [INFO] Problem is higher-order (TPTP THF).
% 1.81/1.33 % [INFO] Type checking passed.
% 1.81/1.33 % [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 ...
% 5.86/2.22 % [INFO] Killing All external provers ...
% 5.86/2.22 % Time passed: 1685ms (effective reasoning time: 1191ms)
% 5.86/2.22 % 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)>
% 5.86/2.22 % Axioms used in derivation (0):
% 5.86/2.22 % No. of inferences in proof: 10
% 5.86/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1685 ms resp. 1191 ms w/o parsing
% 5.86/2.25 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.86/2.25 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------