TSTP Solution File: SYO513^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO513^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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:47 EDT 2024
% Result : Theorem 12.72s 3.15s
% Output : Refutation 12.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 2 unt; 2 typ; 0 def)
% Number of atoms : 23 ( 2 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 9 ~; 2 |; 0 &; 47 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 6 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 ^ 15 !; 8 ?; 25 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: ( ( $o > $o ) > $o ) > $o > $o ).
thf(sk2_type,type,
sk2: ( ( $o > $o ) > $o ) > $o ).
thf(1,conjecture,
? [A: ( $o > $o ) > $o] :
! [B: $o > $o] :
( ? [C: $o] : ( B @ C )
=> ( B @ ( A @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceo) ).
thf(2,negated_conjecture,
~ ? [A: ( $o > $o ) > $o] :
! [B: $o > $o] :
( ? [C: $o] : ( B @ C )
=> ( B @ ( A @ B ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: ( $o > $o ) > $o] :
! [B: $o > $o] :
( ? [C: $o] : ( B @ C )
=> ( B @ ( A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [A: ( $o > $o ) > $o] : ( sk1 @ A @ ( sk2 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,axiom,
? [A: ( $o > $o ) > $o] :
! [B: $o > $o] :
( ? [C: $o] : ( B @ C )
=> ( B @ ( A @ B ) ) ),
introduced(axiom_of_choice) ).
thf(9,plain,
! [B: $o,A: ( $o > $o ) > $o] :
( ~ ( sk1 @ A @ B )
| ( sk1 @ A
@ @+[C: $o] : ( sk1 @ A @ C ) ) ),
inference(choice,[status(esa)],[8]) ).
thf(4,plain,
! [A: ( $o > $o ) > $o] :
~ ( sk1 @ A @ ( A @ ( sk1 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(144,plain,
! [C: ( $o > $o ) > $o,B: $o,A: ( $o > $o ) > $o] :
( ~ ( sk1 @ A @ B )
| ( ( sk1 @ A
@ @+[D: $o] : ( sk1 @ A @ D ) )
!= ( sk1 @ C @ ( C @ ( sk1 @ C ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[9,4]) ).
thf(154,plain,
! [A: $o] :
~ ( sk1 @ ( '@+' @ $o ) @ A ),
inference(pre_uni,[status(thm)],[144:[bind(A,$thf( '@+' @ $o )),bind(B,$thf( B )),bind(C,$thf( '@+' @ $o ))]]) ).
thf(169,plain,
! [A: $o] :
~ ( sk1 @ ( '@+' @ $o ) @ A ),
inference(simp,[status(thm)],[154]) ).
thf(268,plain,
! [B: $o,A: ( $o > $o ) > $o] :
( ( sk1 @ A @ ( sk2 @ A ) )
!= ( sk1 @ ( '@+' @ $o ) @ B ) ),
inference(paramod_ordered,[status(thm)],[5,169]) ).
thf(269,plain,
$false,
inference(pattern_uni,[status(thm)],[268:[bind(A,$thf( '@+' @ $o )),bind(B,$thf( sk2 @ ( '@+' @ $o ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SYO513^1 : TPTP v8.2.0. Released v4.1.0.
% 0.09/0.14 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 09:13:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.99/0.88 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.07/0.99 % [INFO] Parsing done (110ms).
% 1.07/1.00 % [INFO] Running in sequential loop mode.
% 1.63/1.20 % [INFO] nitpick registered as external prover.
% 1.63/1.20 % [INFO] Scanning for conjecture ...
% 1.76/1.25 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.76/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.76/1.26 % [INFO] Problem is higher-order (TPTP THF).
% 1.76/1.27 % [INFO] Type checking passed.
% 1.76/1.27 % [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 ...
% 12.72/3.14 % [INFO] Killing All external provers ...
% 12.72/3.14 % Time passed: 2630ms (effective reasoning time: 2138ms)
% 12.72/3.14 % 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)>
% 12.72/3.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2630 ms resp. 2138 ms w/o parsing
% 12.72/3.17 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.72/3.17 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------