TSTP Solution File: SEU899^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU899^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n014.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 03:44:11 EDT 2024
% Result : Theorem 11.08s 2.91s
% Output : Refutation 11.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 10
% Syntax : Number of formulae : 90 ( 13 unt; 9 typ; 0 def)
% Number of atoms : 283 ( 130 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 520 ( 82 ~; 151 |; 21 &; 266 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 52 ( 0 ^ 31 !; 21 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(cF_type,type,
cF: b > a ).
thf(cS_type,type,
cS: b > $o ).
thf(cR_type,type,
cR: b > $o ).
thf(sk1_type,type,
sk1: a ).
thf(sk2_type,type,
sk2: b ).
thf(sk3_type,type,
sk3: b ).
thf(sk4_type,type,
sk4: b ).
thf(1,conjecture,
! [A: a] :
( ( ? [B: b] :
( ( ( cR @ B )
| ( cS @ B ) )
& ( A
= ( cF @ B ) ) ) )
= ( ? [B: b] :
( ( cR @ B )
& ( A
= ( cF @ B ) ) )
| ? [B: b] :
( ( cS @ B )
& ( A
= ( cF @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM34_pme) ).
thf(2,negated_conjecture,
~ ! [A: a] :
( ( ? [B: b] :
( ( ( cR @ B )
| ( cS @ B ) )
& ( A
= ( cF @ B ) ) ) )
= ( ? [B: b] :
( ( cR @ B )
& ( A
= ( cF @ B ) ) )
| ? [B: b] :
( ( cS @ B )
& ( A
= ( cF @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a] :
( ( ? [B: b] :
( ( ( cR @ B )
| ( cS @ B ) )
& ( A
= ( cF @ B ) ) ) )
= ( ? [B: b] :
( ( cR @ B )
& ( A
= ( cF @ B ) ) )
| ? [B: b] :
( ( cS @ B )
& ( A
= ( cF @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ? [A: b] :
( ( ( cR @ A )
| ( cS @ A ) )
& ( sk1
= ( cF @ A ) ) ) )
!= ( ? [A: b] :
( ( cR @ A )
& ( sk1
= ( cF @ A ) ) )
| ? [A: b] :
( ( cS @ A )
& ( sk1
= ( cF @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ? [A: b] :
( ( ( cR @ A )
| ( cS @ A ) )
& ( sk1
= ( cF @ A ) ) ) )
!= ( ? [A: b] :
( ( cR @ A )
& ( sk1
= ( cF @ A ) ) )
| ? [A: b] :
( ( cS @ A )
& ( sk1
= ( cF @ A ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ? [A: b] :
( ( ( cR @ A )
| ( cS @ A ) )
& ( sk1
= ( cF @ A ) ) )
| ? [A: b] :
( ( cR @ A )
& ( sk1
= ( cF @ A ) ) )
| ? [A: b] :
( ( cS @ A )
& ( sk1
= ( cF @ A ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(24,plain,
( ( sk1
= ( cF @ sk3 ) )
| ( sk1
= ( cF @ sk4 ) )
| ( cR @ sk2 )
| ( cS @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(31,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk2 )
| ( cS @ sk2 ) ),
inference(lifteq,[status(thm)],[24]) ).
thf(23,plain,
( ( sk1
= ( cF @ sk3 ) )
| ( sk1
= ( cF @ sk4 ) )
| ( sk1
= ( cF @ sk2 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(29,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk4 )
= sk1 )
| ( ( cF @ sk2 )
= sk1 ) ),
inference(lifteq,[status(thm)],[23]) ).
thf(19,plain,
( ( cR @ sk3 )
| ( cS @ sk4 )
| ( sk1
= ( cF @ sk2 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(30,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cR @ sk3 )
| ( cS @ sk4 ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(22,plain,
( ( sk1
= ( cF @ sk3 ) )
| ( cS @ sk4 )
| ( sk1
= ( cF @ sk2 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(27,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk2 )
= sk1 )
| ( cS @ sk4 ) ),
inference(lifteq,[status(thm)],[22]) ).
thf(6,plain,
( ~ ? [A: b] :
( ( ( cR @ A )
| ( cS @ A ) )
& ( sk1
= ( cF @ A ) ) )
| ~ ( ? [A: b] :
( ( cR @ A )
& ( sk1
= ( cF @ A ) ) )
| ? [A: b] :
( ( cS @ A )
& ( sk1
= ( cF @ A ) ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(11,plain,
! [B: b,A: b] :
( ~ ( cR @ B )
| ( sk1
!= ( cF @ B ) )
| ~ ( cR @ A )
| ( sk1
!= ( cF @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(17,plain,
! [B: b,A: b] :
( ( ( cF @ B )
!= sk1 )
| ( ( cF @ A )
!= sk1 )
| ~ ( cR @ B )
| ~ ( cR @ A ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(625,plain,
! [B: b,A: b] :
( ( ( cF @ B )
!= sk1 )
| ( ( cF @ A )
!= sk1 )
| ~ ( cR @ B )
| ( ( cR @ A )
!= ( cR @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[17]) ).
thf(626,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ( ( cF @ A )
!= sk1 )
| ~ ( cR @ A ) ),
inference(pattern_uni,[status(thm)],[625:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(645,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ~ ( cR @ A ) ),
inference(simp,[status(thm)],[626]) ).
thf(683,plain,
! [A: b] :
( ( ( cF @ sk2 )
= sk1 )
| ( cS @ sk4 )
| ~ ( cR @ A )
| ( ( cF @ sk3 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[27,645]) ).
thf(684,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cS @ sk4 )
| ~ ( cR @ sk3 ) ),
inference(pattern_uni,[status(thm)],[683:[bind(A,$thf( sk3 ))]]) ).
thf(1993,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cS @ sk4 )
| ( ( cR @ sk3 )
!= ( cR @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[30,684]) ).
thf(1994,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cS @ sk4 ) ),
inference(pattern_uni,[status(thm)],[1993:[]]) ).
thf(8,plain,
! [B: b,A: b] :
( ~ ( cS @ B )
| ( sk1
!= ( cF @ B ) )
| ~ ( cS @ A )
| ( sk1
!= ( cF @ A ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(12,plain,
! [B: b,A: b] :
( ( ( cF @ B )
!= sk1 )
| ( ( cF @ A )
!= sk1 )
| ~ ( cS @ B )
| ~ ( cS @ A ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(13,plain,
! [B: b,A: b] :
( ( ( cF @ B )
!= sk1 )
| ( ( cF @ A )
!= sk1 )
| ~ ( cS @ B )
| ~ ( cS @ A ) ),
inference(simp,[status(thm)],[12]) ).
thf(65,plain,
! [B: b,A: b] :
( ( ( cF @ B )
!= sk1 )
| ( ( cF @ A )
!= sk1 )
| ~ ( cS @ B )
| ( ( cS @ A )
!= ( cS @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[13]) ).
thf(66,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ( ( cF @ A )
!= sk1 )
| ~ ( cS @ A ) ),
inference(pattern_uni,[status(thm)],[65:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(68,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ~ ( cS @ A ) ),
inference(simp,[status(thm)],[66]) ).
thf(2101,plain,
! [A: b] :
( ( ( cF @ sk2 )
= sk1 )
| ( ( cF @ A )
!= sk1 )
| ( ( cS @ sk4 )
!= ( cS @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1994,68]) ).
thf(2102,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( ( cF @ sk4 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[2101:[bind(A,$thf( sk4 ))]]) ).
thf(2488,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk2 )
= sk1 )
| ( ( cF @ sk4 )
!= ( cF @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[29,2102]) ).
thf(2489,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk2 )
= sk1 ) ),
inference(pattern_uni,[status(thm)],[2488:[]]) ).
thf(25,plain,
( ( cR @ sk3 )
| ( sk1
= ( cF @ sk4 ) )
| ( sk1
= ( cF @ sk2 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(32,plain,
( ( ( cF @ sk4 )
= sk1 )
| ( ( cF @ sk2 )
= sk1 )
| ( cR @ sk3 ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(217,plain,
! [A: b] :
( ( ( cF @ sk2 )
= sk1 )
| ( cR @ sk3 )
| ~ ( cS @ A )
| ( ( cF @ sk4 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[32,68]) ).
thf(218,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cR @ sk3 )
| ~ ( cS @ sk4 ) ),
inference(pattern_uni,[status(thm)],[217:[bind(A,$thf( sk4 ))]]) ).
thf(2095,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cR @ sk3 )
| ( ( cS @ sk4 )
!= ( cS @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[1994,218]) ).
thf(2096,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cR @ sk3 ) ),
inference(pattern_uni,[status(thm)],[2095:[]]) ).
thf(2315,plain,
! [A: b] :
( ( ( cF @ sk2 )
= sk1 )
| ( ( cF @ A )
!= sk1 )
| ( ( cR @ sk3 )
!= ( cR @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2096,645]) ).
thf(2316,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( ( cF @ sk3 )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[2315:[bind(A,$thf( sk3 ))]]) ).
thf(2512,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( ( cF @ sk3 )
!= ( cF @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[2489,2316]) ).
thf(2513,plain,
( ( cF @ sk2 )
= sk1 ),
inference(pattern_uni,[status(thm)],[2512:[]]) ).
thf(2547,plain,
! [A: b] :
( ~ ( cS @ A )
| ( ( cF @ sk2 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2513,68]) ).
thf(2548,plain,
~ ( cS @ sk2 ),
inference(pattern_uni,[status(thm)],[2547:[bind(A,$thf( sk2 ))]]) ).
thf(2559,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk2 )
| $false ),
inference(rewrite,[status(thm)],[31,2548]) ).
thf(2560,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk2 ) ),
inference(simp,[status(thm)],[2559]) ).
thf(2549,plain,
! [A: b] :
( ~ ( cR @ A )
| ( ( cF @ sk2 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2513,645]) ).
thf(2550,plain,
~ ( cR @ sk2 ),
inference(pattern_uni,[status(thm)],[2549:[bind(A,$thf( sk2 ))]]) ).
thf(2674,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk4 )
= sk1 )
| $false ),
inference(rewrite,[status(thm)],[2560,2550]) ).
thf(2675,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( ( cF @ sk4 )
= sk1 ) ),
inference(simp,[status(thm)],[2674]) ).
thf(21,plain,
( ( cR @ sk3 )
| ( cS @ sk4 )
| ( cR @ sk2 )
| ( cS @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(2563,plain,
( ( cR @ sk3 )
| ( cS @ sk4 )
| ( cR @ sk2 )
| $false ),
inference(rewrite,[status(thm)],[21,2548]) ).
thf(2564,plain,
( ( cR @ sk3 )
| ( cS @ sk4 )
| ( cR @ sk2 ) ),
inference(simp,[status(thm)],[2563]) ).
thf(2600,plain,
( ( cR @ sk3 )
| ( cS @ sk4 )
| $false ),
inference(rewrite,[status(thm)],[2564,2550]) ).
thf(2601,plain,
( ( cR @ sk3 )
| ( cS @ sk4 ) ),
inference(simp,[status(thm)],[2600]) ).
thf(20,plain,
( ( sk1
= ( cF @ sk3 ) )
| ( cS @ sk4 )
| ( cR @ sk2 )
| ( cS @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(26,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( cS @ sk4 )
| ( cR @ sk2 )
| ( cS @ sk2 ) ),
inference(lifteq,[status(thm)],[20]) ).
thf(2103,plain,
! [A: b] :
( ( cS @ sk4 )
| ~ ( cR @ A )
| ( ( cF @ sk2 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1994,645]) ).
thf(2104,plain,
( ( cS @ sk4 )
| ~ ( cR @ sk2 ) ),
inference(pattern_uni,[status(thm)],[2103:[bind(A,$thf( sk2 ))]]) ).
thf(2235,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( cS @ sk4 )
| ( cS @ sk2 )
| ( ( cR @ sk2 )
!= ( cR @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[26,2104]) ).
thf(2236,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( cS @ sk4 )
| ( cS @ sk2 ) ),
inference(pattern_uni,[status(thm)],[2235:[]]) ).
thf(2557,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( cS @ sk4 )
| $false ),
inference(rewrite,[status(thm)],[2236,2548]) ).
thf(2558,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( cS @ sk4 ) ),
inference(simp,[status(thm)],[2557]) ).
thf(2565,plain,
! [A: b] :
( ( cS @ sk4 )
| ~ ( cR @ A )
| ( ( cF @ sk3 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2558,645]) ).
thf(2566,plain,
( ( cS @ sk4 )
| ~ ( cR @ sk3 ) ),
inference(pattern_uni,[status(thm)],[2565:[bind(A,$thf( sk3 ))]]) ).
thf(2604,plain,
( ( cS @ sk4 )
| ( ( cR @ sk3 )
!= ( cR @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[2601,2566]) ).
thf(2605,plain,
cS @ sk4,
inference(pattern_uni,[status(thm)],[2604:[]]) ).
thf(2611,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ( ( cS @ sk4 )
!= ( cS @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2605,68]) ).
thf(2612,plain,
( ( cF @ sk4 )
!= sk1 ),
inference(pattern_uni,[status(thm)],[2611:[bind(A,$thf( sk4 ))]]) ).
thf(18,plain,
( ( cR @ sk3 )
| ( sk1
= ( cF @ sk4 ) )
| ( cR @ sk2 )
| ( cS @ sk2 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(28,plain,
( ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk3 )
| ( cR @ sk2 )
| ( cS @ sk2 ) ),
inference(lifteq,[status(thm)],[18]) ).
thf(2561,plain,
( ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk3 )
| ( cR @ sk2 )
| $false ),
inference(rewrite,[status(thm)],[28,2548]) ).
thf(2562,plain,
( ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk3 )
| ( cR @ sk2 ) ),
inference(simp,[status(thm)],[2561]) ).
thf(2640,plain,
( ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk3 )
| $false ),
inference(rewrite,[status(thm)],[2562,2550]) ).
thf(2641,plain,
( ( ( cF @ sk4 )
= sk1 )
| ( cR @ sk3 ) ),
inference(simp,[status(thm)],[2640]) ).
thf(2642,plain,
cR @ sk3,
inference(simplifyReflect,[status(thm)],[2641,2612]) ).
thf(2644,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ( ( cR @ sk3 )
!= ( cR @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2642,645]) ).
thf(2645,plain,
( ( cF @ sk3 )
!= sk1 ),
inference(pattern_uni,[status(thm)],[2644:[bind(A,$thf( sk3 ))]]) ).
thf(2676,plain,
$false,
inference(simplifyReflect,[status(thm)],[2675,2612,2645]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU899^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.35 % Computer : n014.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Sun May 19 17:05:39 EDT 2024
% 0.16/0.35 % CPUTime :
% 0.84/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/0.94 % [INFO] Parsing done (96ms).
% 1.20/0.95 % [INFO] Running in sequential loop mode.
% 1.44/1.15 % [INFO] nitpick registered as external prover.
% 1.44/1.15 % [INFO] Scanning for conjecture ...
% 1.69/1.21 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.76/1.23 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.76/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.76/1.23 % [INFO] Type checking passed.
% 1.76/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 ...
% 11.08/2.90 % [INFO] Killing All external provers ...
% 11.08/2.91 % Time passed: 2391ms (effective reasoning time: 1955ms)
% 11.08/2.91 % 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)>
% 11.08/2.91 % Axioms used in derivation (0):
% 11.08/2.91 % No. of inferences in proof: 81
% 11.08/2.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2391 ms resp. 1955 ms w/o parsing
% 11.20/3.01 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.20/3.01 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------