TSTP Solution File: SYO223^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO223^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n022.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:38 EDT 2024
% Result : Theorem 5.17s 2.44s
% Output : Refutation 5.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 108 ( 38 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 227 ( 43 ~; 34 |; 13 &; 131 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 57 ( 0 ^ 41 !; 16 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(cJ_type,type,
cJ: $i ).
thf(cLIKE_type,type,
cLIKE: $i > $i > $o ).
thf(cUNIQUE_type,type,
cUNIQUE: $i > $o ).
thf(cS_type,type,
cS: $i ).
thf(cP_type,type,
cP: $i ).
thf(sk2_type,type,
sk2: ( $i > $o ) > $i ).
thf(1,conjecture,
( ( ! [A: $i] :
( ( cUNIQUE @ A )
=> ! [B: $i] : ( A = B ) )
& ( cUNIQUE @ cS ) )
=> ? [A: $i > $o] :
( ( ( A @ cP )
= ( cLIKE @ cP @ cS ) )
& ( ( A @ cJ )
= ( ? [B: $i] :
( ( cUNIQUE @ B )
& ( cLIKE @ cJ @ B ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cLING2) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $i] :
( ( cUNIQUE @ A )
=> ! [B: $i] : ( A = B ) )
& ( cUNIQUE @ cS ) )
=> ? [A: $i > $o] :
( ( ( A @ cP )
= ( cLIKE @ cP @ cS ) )
& ( ( A @ cJ )
= ( ? [B: $i] :
( ( cUNIQUE @ B )
& ( cLIKE @ cJ @ B ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: $i] :
( ( cUNIQUE @ A )
=> ! [B: $i] : ( A = B ) )
& ( cUNIQUE @ cS ) )
=> ? [A: $i > $o] :
( ( ( A @ cP )
= ( cLIKE @ cP @ cS ) )
& ( ( A @ cJ )
= ( ? [B: $i] :
( ( cUNIQUE @ B )
& ( cLIKE @ cJ @ B ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: $i > $o] :
( ( ( A @ cP )
!= ( cLIKE @ cP @ cS ) )
| ( ( A @ cJ )
!= ( ? [B: $i] :
( ( cUNIQUE @ B )
& ( cLIKE @ cJ @ B ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [A: $i > $o] :
( ( ( A @ cP )
!= ( cLIKE @ cP @ cS ) )
| ( ( A @ cJ )
!= ( ? [B: $i] :
( ( cUNIQUE @ B )
& ( cLIKE @ cJ @ B ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(8,plain,
! [A: $i > $o] :
( ( ( A @ cP )
!= ( cLIKE @ cP @ cS ) )
| ( ( A @ cJ )
!= ( ? [B: $i] :
( ( cUNIQUE @ B )
& ( cLIKE @ cJ @ B ) ) ) ) ),
inference(simp,[status(thm)],[7]) ).
thf(5,plain,
cUNIQUE @ cS,
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [B: $i,A: $i] :
( ~ ( cUNIQUE @ A )
| ( A = B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( cUNIQUE @ A ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( A = B )
| ( ( cUNIQUE @ cS )
!= ( cUNIQUE @ A ) ) ),
inference(paramod_ordered,[status(thm)],[5,9]) ).
thf(15,plain,
! [A: $i] : ( cS = A ),
inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( cS ))]]) ).
thf(17,plain,
! [A: $i] : ( cS = A ),
inference(simp,[status(thm)],[15]) ).
thf(18,plain,
! [A: $i] :
( ( cUNIQUE @ A )
| ( cS != cS ) ),
inference(paramod_ordered,[status(thm)],[17,5]) ).
thf(19,plain,
! [A: $i] : ( cUNIQUE @ A ),
inference(pattern_uni,[status(thm)],[18:[]]) ).
thf(31,plain,
! [A: $i > $o] :
( ( ( A @ cP )
!= ( cLIKE @ cP @ cS ) )
| ( ( A @ cJ )
!= ( ? [B: $i] :
( $true
& ( cLIKE @ cJ @ B ) ) ) ) ),
inference(rewrite,[status(thm)],[8,19]) ).
thf(32,plain,
! [A: $i > $o] :
( ( ( A @ cP )
!= ( cLIKE @ cP @ cS ) )
| ( ( A @ cJ )
!= ( ? [B: $i] : ( cLIKE @ cJ @ B ) ) ) ),
inference(simp,[status(thm)],[31]) ).
thf(36,plain,
! [A: $i > $o] :
( ( A @ cP )
| ( cLIKE @ cP @ cS )
| ( A @ cJ )
| ? [B: $i] : ( cLIKE @ cJ @ B ) ),
inference(bool_ext,[status(thm)],[32]) ).
thf(61,plain,
! [A: $i > $o] :
( ( cLIKE @ cJ @ ( sk2 @ A ) )
| ( A @ cJ )
| ( cLIKE @ cP @ cS )
| ( A @ cP ) ),
inference(cnf,[status(esa)],[36]) ).
thf(29,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ $true ),
inference(rewrite,[status(thm)],[9,19]) ).
thf(30,plain,
! [B: $i,A: $i] : ( A = B ),
inference(simp,[status(thm)],[29]) ).
thf(47,plain,
! [B: $i > $o,A: $i] :
( ~ ( cLIKE @ cP @ cS )
| ( ( B @ cJ )
!= ( ? [C: $i] : ( cLIKE @ cJ @ C ) ) )
| ( ( cUNIQUE @ A )
!= ( B @ cP ) ) ),
inference(paramod_ordered,[status(thm)],[19,32]) ).
thf(57,plain,
! [A: $i > $i] :
( ~ ( cLIKE @ cP @ cS )
| ( ( cUNIQUE @ ( A @ cJ ) )
!= ( ? [B: $i] : ( cLIKE @ cJ @ B ) ) ) ),
inference(pre_uni,[status(thm)],[47:[bind(A,$thf( C @ cP )),bind(B,$thf( ^ [D: $i] : ( cUNIQUE @ ( C @ D ) ) ))]]) ).
thf(69,plain,
! [A: $i > $i] :
( ~ ( cLIKE @ cP @ cS )
| ( ( cUNIQUE @ ( A @ cJ ) )
!= ( ? [B: $i] : ( cLIKE @ cJ @ B ) ) ) ),
inference(simp,[status(thm)],[57]) ).
thf(70,plain,
( ~ ( cLIKE @ cP @ cS )
| ~ ? [A: $i] : ( cLIKE @ cJ @ A ) ),
inference(rewrite,[status(thm)],[69,19]) ).
thf(71,plain,
! [A: $i] :
( ~ ( cLIKE @ cJ @ A )
| ~ ( cLIKE @ cP @ cS ) ),
inference(cnf,[status(esa)],[70]) ).
thf(187,plain,
! [A: $i] :
( ~ ( cLIKE @ cJ @ A )
| ( ( cLIKE @ cP @ cS )
!= ( cLIKE @ cJ @ A ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[71]) ).
thf(189,plain,
! [A: $i] :
( ~ ( cLIKE @ cJ @ A )
| ( cP != cJ )
| ( cS != A ) ),
inference(simp,[status(thm)],[187]) ).
thf(197,plain,
( ~ ( cLIKE @ cJ @ cS )
| ( cP != cJ ) ),
inference(simp,[status(thm)],[189]) ).
thf(199,plain,
~ ( cLIKE @ cJ @ cS ),
inference(simplifyReflect,[status(thm)],[197,30]) ).
thf(209,plain,
! [B: $i,A: $i] :
( ~ ( cLIKE @ A @ cS )
| ( B != cJ ) ),
inference(paramod_ordered,[status(thm)],[30,199]) ).
thf(210,plain,
! [A: $i] :
~ ( cLIKE @ A @ cS ),
inference(pattern_uni,[status(thm)],[209:[bind(A,$thf( A )),bind(B,$thf( cJ ))]]) ).
thf(200,plain,
! [A: $i] :
( ~ ( cLIKE @ cJ @ A )
| ( cS != cS ) ),
inference(paramod_ordered,[status(thm)],[17,199]) ).
thf(201,plain,
! [A: $i] :
~ ( cLIKE @ cJ @ A ),
inference(pattern_uni,[status(thm)],[200:[]]) ).
thf(240,plain,
! [A: $i > $o] :
( $false
| ( A @ cJ )
| $false
| ( A @ cP ) ),
inference(rewrite,[status(thm)],[61,210,201]) ).
thf(241,plain,
! [A: $i > $o] :
( ( A @ cJ )
| ( A @ cP ) ),
inference(simp,[status(thm)],[240]) ).
thf(258,plain,
( $false
| $false ),
inference(prim_subst,[status(thm)],[241:[bind(A,$thf( ^ [B: $i] : $false ))]]) ).
thf(267,plain,
$false,
inference(simp,[status(thm)],[258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SYO223^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_Leo-III %s %d
% 0.12/0.35 % Computer : n022.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon May 20 08:39:23 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.90/0.90 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.15/1.05 % [INFO] Parsing done (151ms).
% 1.15/1.06 % [INFO] Running in sequential loop mode.
% 1.48/1.30 % [INFO] nitpick registered as external prover.
% 1.62/1.31 % [INFO] Scanning for conjecture ...
% 1.76/1.37 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.76/1.39 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.76/1.39 % [INFO] Problem is higher-order (TPTP THF).
% 1.76/1.40 % [INFO] Type checking passed.
% 1.76/1.40 % [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.17/2.43 % [INFO] Killing All external provers ...
% 5.17/2.44 % Time passed: 1918ms (effective reasoning time: 1362ms)
% 5.17/2.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)>
% 5.17/2.44 % Axioms used in derivation (0):
% 5.17/2.44 % No. of inferences in proof: 37
% 5.17/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1918 ms resp. 1362 ms w/o parsing
% 5.17/2.49 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.17/2.49 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------