TSTP Solution File: SEV236^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV236^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n001.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 : Mon Jun 24 15:58:35 EDT 2024
% Result : Theorem 7.99s 2.66s
% Output : Refutation 7.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 74 ( 8 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 192 ( 29 ~; 20 |; 10 &; 108 @)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 7 ^ 31 !; 10 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cS_type,type,
cS: a > $o ).
thf(cK_type,type,
cK: ( a > $o ) > a > $o ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: a ).
thf(sk4_type,type,
sk4: ( a > $o ) > a ).
thf(sk5_type,type,
sk5: a > $o ).
thf(1,conjecture,
( ! [A: a > $o,B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
=> ! [C: a] :
( ( cK @ A @ C )
=> ( cK @ B @ C ) ) )
=> ! [A: a] :
( ( cK @ cS @ A )
=> ( cK
@ ^ [B: a] :
? [C: a > $o] :
( ! [D: a] :
( ( C @ D )
=> ( cS @ D ) )
& ( C @ B ) )
@ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM91_pme) ).
thf(2,negated_conjecture,
~ ( ! [A: a > $o,B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
=> ! [C: a] :
( ( cK @ A @ C )
=> ( cK @ B @ C ) ) )
=> ! [A: a] :
( ( cK @ cS @ A )
=> ( cK
@ ^ [B: a] :
? [C: a > $o] :
( ! [D: a] :
( ( C @ D )
=> ( cS @ D ) )
& ( C @ B ) )
@ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: a > $o,B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
=> ! [C: a] :
( ( cK @ A @ C )
=> ( cK @ B @ C ) ) )
=> ! [A: a] :
( ( cK @ cS @ A )
=> ( cK
@ ^ [B: a] :
? [C: a > $o] :
( ! [D: a] :
( ( C @ D )
=> ( cS @ D ) )
& ( C @ B ) )
@ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
cK @ cS @ sk2,
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
~ ( cK
@ ^ [A: a] :
? [B: a > $o] :
( ! [C: a] :
( ( B @ C )
=> ( cS @ C ) )
& ( B @ A ) )
@ sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
( ( cK @ cS @ sk2 )
!= ( cK
@ ^ [A: a] :
? [B: a > $o] :
( ! [C: a] :
( ( B @ C )
=> ( cS @ C ) )
& ( B @ A ) )
@ sk2 ) ),
inference(paramod_ordered,[status(thm)],[5,4]) ).
thf(9,plain,
( ( cS
!= ( ^ [A: a] :
? [B: a > $o] :
( ! [C: a] :
( ( B @ C )
=> ( cS @ C ) )
& ( B @ A ) ) ) )
| ( sk2 != sk2 ) ),
inference(simp,[status(thm)],[8]) ).
thf(10,plain,
( cS
!= ( ^ [A: a] :
? [B: a > $o] :
( ! [C: a] :
( ( B @ C )
=> ( cS @ C ) )
& ( B @ A ) ) ) ),
inference(simp,[status(thm)],[9]) ).
thf(11,plain,
( ( cS @ sk3 )
!= ( ? [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cS @ B ) )
& ( A @ sk3 ) ) ) ),
inference(func_ext,[status(esa)],[10]) ).
thf(13,plain,
( ( cS @ sk3 )
| ? [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cS @ B ) )
& ( A @ sk3 ) ) ),
inference(bool_ext,[status(thm)],[11]) ).
thf(16,plain,
( ( sk5 @ sk3 )
| ( cS @ sk3 ) ),
inference(cnf,[status(esa)],[13]) ).
thf(17,plain,
! [A: a] :
( ~ ( sk5 @ A )
| ( cS @ A )
| ( cS @ sk3 ) ),
inference(cnf,[status(esa)],[13]) ).
thf(831,plain,
! [A: a] :
( ( cS @ sk3 )
| ( cS @ A )
| ( ( sk5 @ sk3 )
!= ( sk5 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[16,17]) ).
thf(832,plain,
( ( cS @ sk3 )
| ( cS @ sk3 ) ),
inference(pattern_uni,[status(thm)],[831:[bind(A,$thf( sk3 ))]]) ).
thf(835,plain,
cS @ sk3,
inference(simp,[status(thm)],[832]) ).
thf(12,plain,
( ~ ( cS @ sk3 )
| ~ ? [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cS @ B ) )
& ( A @ sk3 ) ) ),
inference(bool_ext,[status(thm)],[11]) ).
thf(14,plain,
! [A: a > $o] :
( ( A @ ( sk4 @ A ) )
| ~ ( A @ sk3 )
| ~ ( cS @ sk3 ) ),
inference(cnf,[status(esa)],[12]) ).
thf(15,plain,
! [A: a > $o] :
( ~ ( cS @ ( sk4 @ A ) )
| ~ ( A @ sk3 )
| ~ ( cS @ sk3 ) ),
inference(cnf,[status(esa)],[12]) ).
thf(21,plain,
! [A: a > $o] :
( ~ ( cS @ ( sk4 @ A ) )
| ~ ( cS @ sk3 )
| ( ( A @ sk3 )
!= ( cS @ sk3 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[15]) ).
thf(34,plain,
( ~ ( cS @ ( sk4 @ cS ) )
| ~ ( cS @ sk3 ) ),
inference(pre_uni,[status(thm)],[21:[bind(A,$thf( cS ))]]) ).
thf(664,plain,
! [A: a > $o] :
( ~ ( A @ sk3 )
| ~ ( cS @ sk3 )
| ( ( A @ ( sk4 @ A ) )
!= ( cS @ ( sk4 @ cS ) ) ) ),
inference(paramod_ordered,[status(thm)],[14,34]) ).
thf(721,plain,
( ~ ( cS @ sk3 )
| ~ ( cS @ sk3 ) ),
inference(pre_uni,[status(thm)],[664:[bind(A,$thf( cS ))]]) ).
thf(800,plain,
~ ( cS @ sk3 ),
inference(simp,[status(thm)],[721]) ).
thf(859,plain,
$false,
inference(rewrite,[status(thm)],[835,800]) ).
thf(860,plain,
$false,
inference(simp,[status(thm)],[859]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV236^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_Leo-III %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 18:16:55 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.90/0.83 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.12/0.93 % [INFO] Parsing done (99ms).
% 1.12/0.93 % [INFO] Running in sequential loop mode.
% 1.50/1.14 % [INFO] eprover registered as external prover.
% 1.50/1.14 % [INFO] Scanning for conjecture ...
% 1.71/1.20 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.85/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.85/1.22 % [INFO] Problem is higher-order (TPTP THF).
% 1.85/1.23 % [INFO] Type checking passed.
% 1.85/1.23 % [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 ...
% 7.99/2.66 % [INFO] Killing All external provers ...
% 7.99/2.66 % Time passed: 2121ms (effective reasoning time: 1719ms)
% 7.99/2.66 % 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)>
% 7.99/2.66 % Axioms used in derivation (0):
% 7.99/2.66 % No. of inferences in proof: 25
% 7.99/2.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2121 ms resp. 1719 ms w/o parsing
% 7.99/2.68 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.99/2.68 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------