TSTP Solution File: SYO518^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO518^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.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 09:00:48 EDT 2024
% Result : Theorem 3.05s 2.09s
% Output : Refutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 5 unt; 2 typ; 0 def)
% Number of atoms : 61 ( 50 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 60 ( 19 ~; 7 |; 8 &; 21 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 17 !; 5 ?; 40 :)
% ( 0 !>; 0 ?*; 0 @-; 18 @+)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(1,conjecture,
? [A: $o > $i > $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ $true @ B @ C )
= B )
& ( ( A @ $false @ B @ C )
= C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifi) ).
thf(2,negated_conjecture,
~ ? [A: $o > $i > $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ $true @ B @ C )
= B )
& ( ( A @ $false @ B @ C )
= C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $o > $i > $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ $true @ B @ C )
= B )
& ( ( A @ $false @ B @ C )
= C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ! [A: $i,B: $i] :
( ( ( @+[C: $i] :
( ( $true
=> ( C = A ) )
& ( ~ $true
=> ( C = B ) ) ) )
= A )
& ( ( @+[C: $i] :
( ( $false
=> ( C = A ) )
& ( ~ $false
=> ( C = B ) ) ) )
= B ) ),
inference(instance,[status(thm)],[3]) ).
thf(5,plain,
~ ! [A: $i,B: $i] :
( ( ( @+[C: $i] : ( C = A ) )
= A )
& ( ( @+[C: $i] : ( C = B ) )
= B ) ),
inference(simp,[status(thm)],[4]) ).
thf(6,plain,
~ ( ! [A: $i] :
( ( @+[B: $i] : ( B = A ) )
= A )
& ! [A: $i] :
( ( @+[B: $i] : ( B = A ) )
= A ) ),
inference(miniscope,[status(thm)],[5]) ).
thf(7,plain,
( ( ( @+[A: $i] : ( A = sk1 ) )
!= sk1 )
| ( ( @+[A: $i] : ( A = sk2 ) )
!= sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(10,plain,
( ( ( @+[A: $i] : ( A = sk1 ) )
!= sk1 )
| ( ( @+[A: $i] : ( A = sk2 ) )
!= sk2 ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(12,axiom,
? [A: ( $i > $o ) > $i] :
! [B: $i > $o] :
( ? [C: $i] : ( B @ C )
=> ( B @ ( A @ B ) ) ),
introduced(axiom_of_choice) ).
thf(13,plain,
! [A: $i] :
( ( A != sk1 )
| ( ( @+[B: $i] : ( B = sk1 ) )
= sk1 ) ),
inference(choice,[status(esa)],[12]) ).
thf(15,plain,
! [A: $i] :
( ( A != sk1 )
| ( ( @+[B: $i] : ( B = sk1 ) )
= sk1 ) ),
inference(lifteq,[status(thm)],[13]) ).
thf(16,plain,
( ( @+[A: $i] : ( A = sk1 ) )
= sk1 ),
inference(simp,[status(thm)],[15]) ).
thf(19,plain,
( ( sk1 != sk1 )
| ( ( @+[A: $i] : ( A = sk2 ) )
!= sk2 ) ),
inference(rewrite,[status(thm)],[10,16]) ).
thf(20,plain,
( ( @+[A: $i] : ( A = sk2 ) )
!= sk2 ),
inference(simp,[status(thm)],[19]) ).
thf(14,plain,
! [A: $i] :
( ( A != sk2 )
| ( ( @+[B: $i] : ( B = sk2 ) )
= sk2 ) ),
inference(choice,[status(esa)],[12]) ).
thf(17,plain,
! [A: $i] :
( ( A != sk2 )
| ( ( @+[B: $i] : ( B = sk2 ) )
= sk2 ) ),
inference(lifteq,[status(thm)],[14]) ).
thf(18,plain,
( ( @+[A: $i] : ( A = sk2 ) )
= sk2 ),
inference(simp,[status(thm)],[17]) ).
thf(25,plain,
sk2 != sk2,
inference(rewrite,[status(thm)],[20,18]) ).
thf(26,plain,
$false,
inference(simp,[status(thm)],[25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYO518^1 : TPTP v8.2.0. Released v4.1.0.
% 0.02/0.12 % Command : run_Leo-III %s %d
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 10:34:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.99/0.96 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.26/1.11 % [INFO] Parsing done (154ms).
% 1.26/1.13 % [INFO] Running in sequential loop mode.
% 1.87/1.51 % [INFO] nitpick registered as external prover.
% 1.87/1.51 % [INFO] Scanning for conjecture ...
% 2.01/1.60 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.15/1.64 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.15/1.64 % [INFO] Problem is higher-order (TPTP THF).
% 2.15/1.64 % [INFO] Type checking passed.
% 2.15/1.64 % [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 ...
% 3.00/2.08 % [INFO] Killing All external provers ...
% 3.05/2.08 % Time passed: 1603ms (effective reasoning time: 948ms)
% 3.05/2.08 % 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)>
% 3.05/2.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1603 ms resp. 948 ms w/o parsing
% 3.12/2.13 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.12/2.13 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------