TSTP Solution File: SYO239^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO239^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Tue May 21 08:59:41 EDT 2024
% Result : Theorem 17.99s 4.39s
% Output : Refutation 17.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 7 unt; 4 typ; 0 def)
% Number of atoms : 61 ( 60 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 240 ( 35 ~; 9 |; 0 &; 193 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 91 ( 32 ^ 26 !; 33 ?; 91 :)
% Comments :
%------------------------------------------------------------------------------
thf(s_type,type,
s: $i > $i ).
thf(c2_type,type,
c2: $i ).
thf(c_star_type,type,
c_star: $i > $i > $i ).
thf(sk1_type,type,
sk1: ( $i > $o ) > $i ).
thf(1,conjecture,
( ! [A: $i] :
( ( ? [B: $i] :
( A
= ( c_star @ c2 @ B ) ) )
= ( ~ ? [B: $i] :
( ( s @ A )
= ( c_star @ c2 @ B ) ) ) )
=> ? [A: $i > $o] :
! [B: $i] :
( ( A @ B )
= ( ~ ( A @ ( s @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE_FENG_SV_EO1_W_LEM) ).
thf(2,negated_conjecture,
~ ( ! [A: $i] :
( ( ? [B: $i] :
( A
= ( c_star @ c2 @ B ) ) )
= ( ~ ? [B: $i] :
( ( s @ A )
= ( c_star @ c2 @ B ) ) ) )
=> ? [A: $i > $o] :
! [B: $i] :
( ( A @ B )
= ( ~ ( A @ ( s @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i] :
( ( ? [B: $i] :
( A
= ( c_star @ c2 @ B ) ) )
= ( ~ ? [B: $i] :
( ( s @ A )
= ( c_star @ c2 @ B ) ) ) )
=> ? [A: $i > $o] :
! [B: $i] :
( ( A @ B )
= ( ~ ( A @ ( s @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [A: $i] :
( ( ? [B: $i] :
( A
= ( c_star @ c2 @ B ) ) )
= ( ~ ? [B: $i] :
( ( s @ A )
= ( c_star @ c2 @ B ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [A: $i] :
( ( ? [B: $i] :
( A
= ( c_star @ c2 @ B ) ) )
= ( ~ ? [B: $i] :
( ( s @ A )
= ( c_star @ c2 @ B ) ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(4,plain,
! [A: $i > $o] :
( ( A @ ( sk1 @ A ) )
!= ( ~ ( A @ ( s @ ( sk1 @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [A: $i > $o] :
( ( ~ ( A @ ( s @ ( sk1 @ A ) ) ) )
!= ( A @ ( sk1 @ A ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
! [A: $i > $o] :
( ( ~ ( A @ ( s @ ( sk1 @ A ) ) ) )
!= ( A @ ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[6]) ).
thf(17,plain,
! [B: $i > $o,A: $i] :
( ( ( ? [C: $i] :
( A
= ( c_star @ c2 @ C ) ) )
!= ( B @ ( sk1 @ B ) ) )
| ( ( ~ ? [C: $i] :
( ( s @ A )
= ( c_star @ c2 @ C ) ) )
!= ( ~ ( B @ ( s @ ( sk1 @ B ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[8,7]) ).
thf(20,plain,
! [B: $i > $i > $i,A: $i] :
( ( ( ? [C: $i] :
( A
= ( c_star @ c2 @ C ) ) )
!= ( ? [C: $i] :
( ( s
@ ( B
@ ( sk1
@ ^ [D: $i] :
? [E: $i] :
( ( s @ ( B @ D @ E ) )
= ( c_star @ c2 @ E ) ) )
@ C ) )
= ( c_star @ c2 @ C ) ) ) )
| ( ( ^ [C: $i] : A )
!= ( B
@ ( s
@ ( sk1
@ ^ [C: $i] :
? [D: $i] :
( ( s @ ( B @ C @ D ) )
= ( c_star @ c2 @ D ) ) ) ) ) ) ),
inference(pre_uni,[status(thm)],[17:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ? [E: $i] : ( ( s @ ( H @ D @ E ) ) = ( c_star @ c2 @ E ) ) ))]]) ).
thf(24,plain,
! [B: $i > $i > $i,A: $i] :
( ( ( ? [C: $i] :
( A
= ( c_star @ c2 @ C ) ) )
!= ( ? [C: $i] :
( ( s
@ ( B
@ ( sk1
@ ^ [D: $i] :
? [E: $i] :
( ( s @ ( B @ D @ E ) )
= ( c_star @ c2 @ E ) ) )
@ C ) )
= ( c_star @ c2 @ C ) ) ) )
| ( ( ^ [C: $i] : A )
!= ( B
@ ( s
@ ( sk1
@ ^ [C: $i] :
? [D: $i] :
( ( s @ ( B @ C @ D ) )
= ( c_star @ c2 @ D ) ) ) ) ) ) ),
inference(simp,[status(thm)],[20]) ).
thf(51,plain,
! [B: $i > $i > $i,A: $i] :
( ( ( ^ [C: $i] :
( A
= ( c_star @ c2 @ C ) ) )
!= ( ^ [C: $i] :
( ( s
@ ( B
@ ( sk1
@ ^ [D: $i] :
? [E: $i] :
( ( s @ ( B @ D @ E ) )
= ( c_star @ c2 @ E ) ) )
@ C ) )
= ( c_star @ c2 @ C ) ) ) )
| ( ( ^ [C: $i] : A )
!= ( B
@ ( s
@ ( sk1
@ ^ [C: $i] :
? [D: $i] :
( ( s @ ( B @ C @ D ) )
= ( c_star @ c2 @ D ) ) ) ) ) ) ),
inference(simp,[status(thm)],[24]) ).
thf(72,plain,
! [B: $i > $i > $i,A: $i] :
( ( ( ^ [C: $i] : A )
!= ( ^ [C: $i] :
( s
@ ( B
@ ( sk1
@ ^ [D: $i] :
? [E: $i] :
( ( s @ ( B @ D @ E ) )
= ( c_star @ c2 @ E ) ) )
@ C ) ) ) )
| ( ( c_star @ c2 )
!= ( c_star @ c2 ) )
| ( ( ^ [C: $i] : A )
!= ( B
@ ( s
@ ( sk1
@ ^ [C: $i] :
? [D: $i] :
( ( s @ ( B @ C @ D ) )
= ( c_star @ c2 @ D ) ) ) ) ) ) ),
inference(simp,[status(thm)],[51]) ).
thf(74,plain,
! [B: $i > $i > $i,A: $i] :
( ( ( ^ [C: $i] : A )
!= ( ^ [C: $i] :
( s
@ ( B
@ ( sk1
@ ^ [D: $i] :
? [E: $i] :
( ( s @ ( B @ D @ E ) )
= ( c_star @ c2 @ E ) ) )
@ C ) ) ) )
| ( ( ^ [C: $i] : A )
!= ( B
@ ( s
@ ( sk1
@ ^ [C: $i] :
? [D: $i] :
( ( s @ ( B @ C @ D ) )
= ( c_star @ c2 @ D ) ) ) ) ) ) ),
inference(simp,[status(thm)],[72]) ).
thf(684,plain,
! [B: $i > $i > $i,A: $i] :
( ( ( ^ [C: $i] : A )
!= ( ^ [C: $i] :
( s
@ ( B
@ ( sk1
@ ^ [D: $i] :
? [E: $i] :
( ( s @ ( B @ D @ E ) )
= ( c_star @ c2 @ E ) ) )
@ C ) ) ) )
| ( ( ^ [C: $i] : A )
!= ( ^ [C: $i] : A ) )
| ( ( B
@ ( s
@ ( sk1
@ ^ [C: $i] :
? [D: $i] :
( ( s @ ( B @ C @ D ) )
= ( c_star @ c2 @ D ) ) ) ) )
!= ( ^ [C: $i] :
( s
@ ( B
@ ( sk1
@ ^ [D: $i] :
? [E: $i] :
( ( s @ ( B @ D @ E ) )
= ( c_star @ c2 @ E ) ) )
@ C ) ) ) ) ),
inference(eqfactor_ordered,[status(thm)],[74]) ).
thf(688,plain,
! [A: $i] :
( ( ^ [B: $i] : A )
!= ( ^ [B: $i] :
( s
@ ( s
@ ( s
@ ( sk1
@ ^ [C: $i] :
? [D: $i] :
( ( s @ ( s @ ( s @ C ) ) )
= ( c_star @ c2 @ D ) ) ) ) ) ) ) ),
inference(pre_uni,[status(thm)],[684:[bind(A,$thf( A )),bind(B,$thf( ^ [C: $i] : ^ [D: $i] : ( s @ ( s @ C ) ) ))]]) ).
thf(692,plain,
$false,
inference(pattern_uni,[status(thm)],[688:[bind(A,$thf( s @ ( s @ ( s @ ( sk1 @ ^ [B: $i] : ? [C: $i] : ( ( s @ ( s @ ( s @ B ) ) ) = ( c_star @ c2 @ C ) ) ) ) ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYO239^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.12 % Command : run_Leo-III %s %d
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 08:56:39 EDT 2024
% 0.11/0.33 % CPUTime :
% 1.01/0.93 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.31/1.09 % [INFO] Parsing done (159ms).
% 1.31/1.11 % [INFO] Running in sequential loop mode.
% 1.87/1.47 % [INFO] nitpick registered as external prover.
% 1.87/1.48 % [INFO] Scanning for conjecture ...
% 2.03/1.57 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.03/1.60 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.03/1.60 % [INFO] Problem is higher-order (TPTP THF).
% 2.03/1.61 % [INFO] Type checking passed.
% 2.03/1.61 % [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 ...
% 17.99/4.38 % [INFO] Killing All external provers ...
% 17.99/4.39 % Time passed: 3920ms (effective reasoning time: 3271ms)
% 17.99/4.39 % 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)>
% 17.99/4.39 % Axioms used in derivation (0):
% 17.99/4.39 % No. of inferences in proof: 17
% 17.99/4.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3920 ms resp. 3271 ms w/o parsing
% 17.99/4.45 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 17.99/4.45 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------