TSTP Solution File: SEV229^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEV229^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n032.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 04:10:11 EDT 2024
% Result : Theorem 6.77s 2.34s
% Output : Refutation 6.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 271 ( 50 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 507 ( 114 ~; 135 |; 14 &; 223 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 44 ( 8 ^ 36 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cE_type,type,
cE: a > $o ).
thf(cD_type,type,
cD: a > $o ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: a ).
thf(sk4_type,type,
sk4: a ).
thf(1,conjecture,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5209_pme) ).
thf(2,negated_conjecture,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
!= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
!= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a > $o] :
! [B: a] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) ) )
!= ( ^ [A: a > $o] :
( ! [B: a] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: a] :
( ( A @ B )
=> ( cE @ B ) ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [A: a] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) ) )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: a] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(func_ext,[status(esa)],[4]) ).
thf(6,plain,
( ~ ! [A: a] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) )
| ~ ( ! [A: a] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: a] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(10,plain,
( ( sk1 @ sk3 )
| ~ ( cE @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(14,plain,
( ( sk1 @ sk3 )
| ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(15,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(7,plain,
( ! [A: a] :
( ( sk1 @ A )
=> ( ( cD @ A )
& ( cE @ A ) ) )
| ( ! [A: a] :
( ( sk1 @ A )
=> ( cD @ A ) )
& ! [A: a] :
( ( sk1 @ A )
=> ( cE @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(18,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cD @ B )
| ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(cnf,[status(esa)],[7]) ).
thf(101,plain,
! [B: a,A: a] :
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cD @ B )
| ~ ( sk1 @ A )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[15,18]) ).
thf(102,plain,
! [A: a] :
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cD @ sk4 )
| ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(pattern_uni,[status(thm)],[101:[bind(A,$thf( A )),bind(B,$thf( sk4 ))]]) ).
thf(9,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(8,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(25,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[8]) ).
thf(27,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 )
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[25]) ).
thf(28,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk3 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[15]) ).
thf(31,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( sk4 != sk3 ) ),
inference(simp,[status(thm)],[28]) ).
thf(37,plain,
( ( sk1 @ sk2 )
| ( sk4 != sk3 )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[31]) ).
thf(39,plain,
( ( sk1 @ sk2 )
| ( sk4 != sk3 )
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[37]) ).
thf(254,plain,
! [A: a] :
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cD @ sk4 )
| ( cE @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[15,102]) ).
thf(255,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( cD @ sk4 )
| ( cE @ sk4 ) ),
inference(pattern_uni,[status(thm)],[254:[bind(A,$thf( sk4 ))]]) ).
thf(13,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(62,plain,
( ( sk1 @ sk3 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk3 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[13]) ).
thf(63,plain,
( ( sk1 @ sk3 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk3 ) ) ),
inference(simp,[status(thm)],[62]) ).
thf(11,plain,
( ~ ( cD @ sk3 )
| ~ ( cE @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(29,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[15]) ).
thf(33,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[29]) ).
thf(40,plain,
( ( sk1 @ sk2 )
| ( sk4 != sk2 )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[33]) ).
thf(42,plain,
( ( sk1 @ sk2 )
| ( sk4 != sk2 )
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[40]) ).
thf(19,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cD @ B )
| ~ ( sk1 @ A )
| ( cD @ A ) ),
inference(cnf,[status(esa)],[7]) ).
thf(387,plain,
! [B: a,A: a] :
( ~ ( sk1 @ B )
| ( cD @ B )
| ( cD @ A )
| ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[19]) ).
thf(388,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( cD @ A )
| ( cD @ A ) ),
inference(pattern_uni,[status(thm)],[387:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(390,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( cD @ A ) ),
inference(simp,[status(thm)],[388]) ).
thf(416,plain,
! [A: a] :
( ( sk4 != sk3 )
| ( sk3 != sk2 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[39,390]) ).
thf(417,plain,
( ( sk4 != sk3 )
| ( sk3 != sk2 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[416:[bind(A,$thf( sk2 ))]]) ).
thf(22,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk2 )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[10]) ).
thf(24,plain,
( ( sk1 @ sk2 )
| ~ ( cE @ sk4 )
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[22]) ).
thf(38,plain,
( ( sk1 @ sk2 )
| ( sk4 != sk3 )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) ) ),
inference(simp,[status(thm)],[37]) ).
thf(406,plain,
! [A: a] :
( ~ ( cE @ sk4 )
| ( sk1 @ sk2 )
| ( cD @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[10,390]) ).
thf(407,plain,
( ~ ( cE @ sk4 )
| ( sk1 @ sk2 )
| ( cD @ sk3 ) ),
inference(pattern_uni,[status(thm)],[406:[bind(A,$thf( sk3 ))]]) ).
thf(41,plain,
( ( sk1 @ sk2 )
| ( sk4 != sk2 )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) ) ),
inference(simp,[status(thm)],[40]) ).
thf(32,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk2 ) ) ),
inference(simp,[status(thm)],[29]) ).
thf(64,plain,
( ( sk1 @ sk3 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 )
| ( sk4 != sk3 ) ),
inference(simp,[status(thm)],[62]) ).
thf(12,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(465,plain,
( ( sk4 != sk3 )
| ( sk3 != sk2 )
| ~ ( cE @ sk4 )
| ~ ( cE @ sk2 )
| ( ( cD @ sk2 )
!= ( cD @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[417,27]) ).
thf(466,plain,
( ( sk4 != sk3 )
| ( sk3 != sk2 )
| ~ ( cE @ sk4 )
| ~ ( cE @ sk2 ) ),
inference(pattern_uni,[status(thm)],[465:[]]) ).
thf(34,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk2 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[12]) ).
thf(35,plain,
( ( sk1 @ sk2 )
| ~ ( cD @ sk3 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk2 ) ) ),
inference(simp,[status(thm)],[34]) ).
thf(26,plain,
( ~ ( cE @ sk4 )
| ~ ( cD @ sk2 )
| ~ ( cE @ sk2 )
| ( ( cD @ sk3 )
!= ( cD @ sk2 ) ) ),
inference(simp,[status(thm)],[25]) ).
thf(23,plain,
( ( sk1 @ sk2 )
| ~ ( cE @ sk4 )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) ) ),
inference(simp,[status(thm)],[22]) ).
thf(36,plain,
( ( sk1 @ sk2 )
| ~ ( cD @ sk3 )
| ( sk4 != sk2 ) ),
inference(simp,[status(thm)],[34]) ).
thf(30,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk2 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk3 ) ) ),
inference(simp,[status(thm)],[28]) ).
thf(414,plain,
! [A: a] :
( ~ ( cD @ sk3 )
| ( sk1 @ sk2 )
| ( cD @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[12,390]) ).
thf(415,plain,
( ~ ( cD @ sk3 )
| ( sk1 @ sk2 )
| ( cD @ sk4 ) ),
inference(pattern_uni,[status(thm)],[414:[bind(A,$thf( sk4 ))]]) ).
thf(626,plain,
$false,
inference(e,[status(thm)],[5,10,14,102,9,27,39,255,63,31,11,8,15,42,417,24,38,407,33,13,41,32,64,12,466,3,35,26,390,23,36,30,4,415]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEV229^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.11 % Command : run_Leo-III %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Sun May 19 19:01:08 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.69/0.75 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.00/0.86 % [INFO] Parsing done (108ms).
% 1.00/0.87 % [INFO] Running in sequential loop mode.
% 1.38/1.09 % [INFO] eprover registered as external prover.
% 1.38/1.09 % [INFO] cvc4 registered as external prover.
% 1.38/1.10 % [INFO] Scanning for conjecture ...
% 1.48/1.15 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.53/1.17 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.53/1.17 % [INFO] Problem is higher-order (TPTP THF).
% 1.53/1.17 % [INFO] Type checking passed.
% 1.53/1.18 % [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 ...
% 6.77/2.33 % External prover 'e' found a proof!
% 6.77/2.33 % [INFO] Killing All external provers ...
% 6.77/2.33 % Time passed: 1912ms (effective reasoning time: 1458ms)
% 6.77/2.33 % 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)>
% 6.77/2.34 % Axioms used in derivation (0):
% 6.77/2.34 % No. of inferences in proof: 57
% 6.77/2.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1912 ms resp. 1458 ms w/o parsing
% 6.81/2.38 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.81/2.38 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------