TSTP Solution File: SYO540^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO540^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n023.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:52 EDT 2024
% Result : Theorem 2.49s 1.52s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 11 unt; 4 typ; 1 def)
% Number of atoms : 73 ( 46 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 99 ( 29 ~; 22 |; 24 &; 23 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 31 ( 17 ^ 12 !; 2 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(eps_type,type,
eps: ( $i > $o ) > $i ).
thf(if_type,type,
if: $o > $i > $i > $i ).
thf(if_def,definition,
( if
= ( ^ [A: $o,B: $i,C: $i] :
( eps
@ ^ [D: $i] :
( ( A
& ( D = B ) )
| ( ~ A
& ( D = C ) ) ) ) ) ) ).
thf(sk1_type,type,
sk1: $o ).
thf(sk2_type,type,
sk2: $i ).
thf(10,axiom,
? [A: ( $i > $o ) > $i] :
! [B: $i > $o] :
( ? [C: $i] : ( B @ C )
=> ( B @ ( A @ B ) ) ),
introduced(axiom_of_choice) ).
thf(36,plain,
! [A: $i] :
( ( A != sk2 )
| ( ( eps
@ ^ [B: $i] : ( B = sk2 ) )
= sk2 ) ),
inference(choice,[status(esa)],[10]) ).
thf(37,plain,
! [A: $i] :
( ( A != sk2 )
| ( ( eps
@ ^ [B: $i] : ( B = sk2 ) )
= sk2 ) ),
inference(lifteq,[status(thm)],[36]) ).
thf(38,plain,
( ( eps
@ ^ [A: $i] : ( A = sk2 ) )
= sk2 ),
inference(simp,[status(thm)],[37]) ).
thf(1,conjecture,
! [A: $o,B: $i] :
( ( if @ A @ B @ B )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ! [A: $o,B: $i] :
( ( if @ A @ B @ B )
= B ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ! [A: $o,B: $i] :
( ( eps
@ ^ [C: $i] :
( ( A
& ( C = B ) )
| ( ~ A
& ( C = B ) ) ) )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ( eps
@ ^ [A: $i] :
( ( sk1
& ( A = sk2 ) )
| ( ~ sk1
& ( A = sk2 ) ) ) )
!= sk2 ),
inference(cnf,[status(esa)],[4]) ).
thf(6,plain,
( ( eps
@ ^ [A: $i] :
( ( sk1
& ( A = sk2 ) )
| ( ~ sk1
& ( A = sk2 ) ) ) )
!= sk2 ),
inference(lifteq,[status(thm)],[5]) ).
thf(11,plain,
! [A: $i] :
( ~ ( ( sk1
& ( A = sk2 ) )
| ( ~ sk1
& ( A = sk2 ) ) )
| ( sk1
& ( ( eps
@ ^ [B: $i] :
( ( sk1
& ( B = sk2 ) )
| ( ~ sk1
& ( B = sk2 ) ) ) )
= sk2 ) )
| ( ~ sk1
& ( ( eps
@ ^ [B: $i] :
( ( sk1
& ( B = sk2 ) )
| ( ~ sk1
& ( B = sk2 ) ) ) )
= sk2 ) ) ),
inference(choice,[status(esa)],[10]) ).
thf(17,plain,
! [A: $i] :
( ( ( eps
@ ^ [B: $i] :
( ( sk1
& ( B = sk2 ) )
| ( ~ sk1
& ( B = sk2 ) ) ) )
= sk2 )
| ~ sk1
| ~ sk1
| ( A != sk2 ) ),
inference(cnf,[status(esa)],[11]) ).
thf(23,plain,
! [A: $i] :
( ( ( eps
@ ^ [B: $i] :
( ( sk1
& ( B = sk2 ) )
| ( ~ sk1
& ( B = sk2 ) ) ) )
= sk2 )
| ( A != sk2 )
| ~ sk1
| ~ sk1 ),
inference(lifteq,[status(thm)],[17]) ).
thf(24,plain,
( ( ( eps
@ ^ [A: $i] :
( ( sk1
& ( A = sk2 ) )
| ( ~ sk1
& ( A = sk2 ) ) ) )
= sk2 )
| ~ sk1 ),
inference(simp,[status(thm)],[23]) ).
thf(33,plain,
~ sk1,
inference(simplifyReflect,[status(thm)],[24,6]) ).
thf(34,plain,
( ( eps
@ ^ [A: $i] :
( ( $false
& ( A = sk2 ) )
| ( ~ $false
& ( A = sk2 ) ) ) )
!= sk2 ),
inference(rewrite,[status(thm)],[6,33]) ).
thf(35,plain,
( ( eps
@ ^ [A: $i] : ( A = sk2 ) )
!= sk2 ),
inference(simp,[status(thm)],[34]) ).
thf(39,plain,
$false,
inference(simplifyReflect,[status(thm)],[38,35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO540^1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:40:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.97/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.96 % [INFO] Parsing done (102ms).
% 1.20/0.97 % [INFO] Running in sequential loop mode.
% 1.62/1.17 % [INFO] nitpick registered as external prover.
% 1.62/1.17 % [INFO] Scanning for conjecture ...
% 1.73/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 1.80/1.25 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.80/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.80/1.25 % [INFO] Type checking passed.
% 1.80/1.25 % [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 ...
% 2.49/1.51 % [INFO] Killing All external provers ...
% 2.49/1.52 % Time passed: 995ms (effective reasoning time: 547ms)
% 2.49/1.52 % 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)>
% 2.49/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 995 ms resp. 547 ms w/o parsing
% 2.58/1.57 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.58/1.57 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------