TSTP Solution File: SEU856^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU856^5 : TPTP v8.2.0. Released v4.0.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 03:44:05 EDT 2024
% Result : Theorem 22.46s 4.67s
% Output : Refutation 22.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 59
% Number of leaves : 6
% Syntax : Number of formulae : 91 ( 13 unt; 5 typ; 0 def)
% Number of atoms : 421 ( 83 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 632 ( 127 ~; 165 |; 22 &; 318 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 18 ^ 48 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk5_type,type,
sk5: a ).
thf(sk6_type,type,
sk6: a ).
thf(1,conjecture,
! [A: a > $o,B: a > $o] :
( ( A = B )
= ( ( ^ [C: a] :
( ( ( B @ C )
& ~ ( A @ C ) )
| ( ( A @ C )
& ~ ( B @ C ) ) ) )
= ( ^ [C: a] : $false ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGAZING_THM46_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o] :
( ( A = B )
= ( ( ^ [C: a] :
( ( ( B @ C )
& ~ ( A @ C ) )
| ( ( A @ C )
& ~ ( B @ C ) ) ) )
= ( ^ [C: a] : $false ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o] :
( ( A = B )
= ( ( ^ [C: a] :
( ( ( B @ C )
& ~ ( A @ C ) )
| ( ( A @ C )
& ~ ( B @ C ) ) ) )
= ( ^ [C: a] : $false ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( sk1 = sk2 )
!= ( ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) )
= ( ^ [A: a] : $false ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) )
= ( ^ [A: a] : $false ) )
!= ( sk1 = sk2 ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(8,plain,
( ( ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) )
= ( ^ [A: a] : $false ) )
| ( sk1 = sk2 ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(10,plain,
( ( ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) )
= ( ^ [A: a] : $false ) )
| ( sk2 = sk1 ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(17,plain,
! [B: a,A: a] :
( ~ ( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) )
| ( ( sk2 @ B )
= ( sk1 @ B ) ) ),
inference(func_ext,[status(esa)],[10]) ).
thf(25,plain,
! [B: a,A: a] :
( ( ( sk2 @ B )
= ( sk1 @ B ) )
| ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(cnf,[status(esa)],[17]) ).
thf(7,plain,
( ( ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) )
!= ( ^ [A: a] : $false ) )
| ( sk1 != sk2 ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ^ [A: a] :
( ( ( sk2 @ A )
& ~ ( sk1 @ A ) )
| ( ( sk1 @ A )
& ~ ( sk2 @ A ) ) ) )
!= ( ^ [A: a] : $false ) )
| ( sk2 != sk1 ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(12,plain,
( ( ( sk2 @ sk5 )
& ~ ( sk1 @ sk5 ) )
| ( ( sk1 @ sk5 )
& ~ ( sk2 @ sk5 ) )
| ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(func_ext,[status(esa)],[9]) ).
thf(16,plain,
( ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ~ ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[12]) ).
thf(13,plain,
( ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ( sk2 @ sk5 )
| ( sk1 @ sk5 ) ),
inference(cnf,[status(esa)],[12]) ).
thf(33,plain,
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ( sk2 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(bool_ext,[status(thm)],[13]) ).
thf(26,plain,
! [B: a,A: a] :
( ( ( sk2 @ B )
= ( sk1 @ B ) )
| ~ ( sk2 @ A )
| ( sk1 @ A ) ),
inference(cnf,[status(esa)],[17]) ).
thf(522,plain,
! [B: a,A: a] :
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk2 @ B )
= ( sk1 @ B ) )
| ( sk1 @ A )
| ( ( sk2 @ sk6 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[33,26]) ).
thf(523,plain,
! [A: a] :
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk2 @ A )
= ( sk1 @ A ) )
| ( sk1 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[522:[bind(A,$thf( sk6 ))]]) ).
thf(580,plain,
! [A: a] :
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk2 @ A )
= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[523]) ).
thf(1091,plain,
! [A: a] :
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk1 @ A )
!= ( sk1 @ sk6 ) )
| ( ( sk2 @ A )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[580,13]) ).
thf(1092,plain,
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[1091:[bind(A,$thf( sk6 ))]]) ).
thf(1201,plain,
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ( sk1 @ sk6 ) ),
inference(simp,[status(thm)],[1092]) ).
thf(1248,plain,
! [B: a,A: a] :
( ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk2 @ B )
= ( sk1 @ B ) )
| ( sk1 @ A )
| ( ( sk2 @ sk5 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1201,26]) ).
thf(1249,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk2 @ A )
= ( sk1 @ A ) )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1248:[bind(A,$thf( sk5 ))]]) ).
thf(1259,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( ( sk2 @ A )
= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[1249]) ).
thf(1439,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( sk1 @ A )
| ( ( sk2 @ sk5 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1201,1259]) ).
thf(1440,plain,
( ( sk1 @ sk5 )
| ( sk1 @ sk6 )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1439:[bind(A,$thf( sk5 ))]]) ).
thf(1499,plain,
( ( sk1 @ sk5 )
| ( sk1 @ sk6 ) ),
inference(simp,[status(thm)],[1440]) ).
thf(1507,plain,
! [B: a,A: a] :
( ( sk1 @ sk5 )
| ( ( sk2 @ B )
= ( sk1 @ B ) )
| ( sk2 @ A )
| ( ( sk1 @ sk6 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1499,25]) ).
thf(1508,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( ( sk2 @ A )
= ( sk1 @ A ) )
| ( sk2 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[1507:[bind(A,$thf( sk6 ))]]) ).
thf(1555,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( ( sk2 @ A )
= ( sk1 @ A ) )
| ( sk2 @ sk6 ) ),
inference(simp,[status(thm)],[1508]) ).
thf(1897,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( sk2 @ sk6 )
| ( ( sk1 @ A )
!= ( sk1 @ sk6 ) )
| ( sk2 @ sk5 )
| ( ( sk2 @ A )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[1555,13]) ).
thf(1898,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk6 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) )
| ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[1897:[bind(A,$thf( sk6 ))]]) ).
thf(2017,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk6 )
| ( sk2 @ sk5 ) ),
inference(simp,[status(thm)],[1898]) ).
thf(32,plain,
( ( sk2 @ sk5 )
| ( sk1 @ sk5 )
| ~ ( sk2 @ sk6 )
| ~ ( sk1 @ sk6 ) ),
inference(bool_ext,[status(thm)],[13]) ).
thf(1516,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ~ ( sk2 @ sk6 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[1499,32]) ).
thf(1517,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ~ ( sk2 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[1516:[]]) ).
thf(2033,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk2 @ sk6 )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[2017,1517]) ).
thf(2034,plain,
( ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[2033:[]]) ).
thf(2120,plain,
! [B: a,A: a] :
( ( sk1 @ sk5 )
| ( ( sk2 @ B )
= ( sk1 @ B ) )
| ( sk1 @ A )
| ( ( sk2 @ sk5 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2034,26]) ).
thf(2121,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( ( sk2 @ A )
= ( sk1 @ A ) )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[2120:[bind(A,$thf( sk5 ))]]) ).
thf(2139,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( ( sk2 @ A )
= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[2121]) ).
thf(2157,plain,
! [A: a] :
( ( sk1 @ sk5 )
| ( sk1 @ A )
| ( ( sk2 @ A )
!= ( sk2 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[2139,2034]) ).
thf(2158,plain,
( ( sk1 @ sk5 )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[2157:[bind(A,$thf( sk5 ))]]) ).
thf(2246,plain,
sk1 @ sk5,
inference(simp,[status(thm)],[2158]) ).
thf(2260,plain,
( ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ~ $true
| ~ ( sk2 @ sk5 ) ),
inference(rewrite,[status(thm)],[16,2246]) ).
thf(2261,plain,
( ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ~ ( sk2 @ sk5 ) ),
inference(simp,[status(thm)],[2260]) ).
thf(2268,plain,
! [B: a,A: a] :
( ( ( sk2 @ B )
= ( sk1 @ B ) )
| ( sk2 @ A )
| ( ( sk1 @ sk5 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2246,25]) ).
thf(2269,plain,
! [A: a] :
( ( ( sk2 @ A )
= ( sk1 @ A ) )
| ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[2268:[bind(A,$thf( sk5 ))]]) ).
thf(2286,plain,
! [A: a] :
( ( ( sk2 @ A )
= ( sk1 @ A ) )
| ( sk2 @ sk5 ) ),
inference(simp,[status(thm)],[2269]) ).
thf(2427,plain,
! [A: a] :
( ( sk2 @ sk5 )
| ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ~ ( sk1 @ A )
| ( ( sk2 @ A )
!= ( sk2 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[2286,2261]) ).
thf(2428,plain,
( ( sk2 @ sk5 )
| ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[2427:[bind(A,$thf( sk5 ))]]) ).
thf(3205,plain,
( ( sk2 @ sk5 )
| ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ~ $true ),
inference(rewrite,[status(thm)],[2428,2246]) ).
thf(3206,plain,
( ( sk2 @ sk5 )
| ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(simp,[status(thm)],[3205]) ).
thf(3221,plain,
! [A: a] :
( ( sk2 @ sk5 )
| ( ( sk1 @ A )
!= ( sk1 @ sk6 ) )
| ( ( sk2 @ A )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[2286,3206]) ).
thf(3222,plain,
( ( sk2 @ sk5 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[3221:[bind(A,$thf( sk6 ))]]) ).
thf(3243,plain,
sk2 @ sk5,
inference(simp,[status(thm)],[3222]) ).
thf(3253,plain,
( ( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) )
| ~ $true ),
inference(rewrite,[status(thm)],[2261,3243]) ).
thf(3254,plain,
( ( sk2 @ sk6 )
!= ( sk1 @ sk6 ) ),
inference(simp,[status(thm)],[3253]) ).
thf(3294,plain,
! [B: a,A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A )
| ( ( sk1 @ B )
!= ( sk1 @ sk6 ) )
| ( ( sk2 @ B )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[25,3254]) ).
thf(3295,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[3294:[bind(A,$thf( A )),bind(B,$thf( sk6 ))]]) ).
thf(3321,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(simp,[status(thm)],[3295]) ).
thf(27,plain,
( ~ ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 )
| ~ ( sk2 @ sk6 )
| ~ ( sk1 @ sk6 ) ),
inference(bool_ext,[status(thm)],[16]) ).
thf(29,plain,
( ~ ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 )
| ~ ( sk1 @ sk6 )
| ( ( sk2 @ sk6 )
!= ( sk2 @ sk5 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[27]) ).
thf(30,plain,
( ~ ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 )
| ~ ( sk1 @ sk6 )
| ( ( sk2 @ sk6 )
!= ( sk2 @ sk5 ) ) ),
inference(simp,[status(thm)],[29]) ).
thf(2264,plain,
( ~ $true
| ~ ( sk2 @ sk5 )
| ~ ( sk1 @ sk6 )
| ( ( sk2 @ sk6 )
!= ( sk2 @ sk5 ) ) ),
inference(rewrite,[status(thm)],[30,2246]) ).
thf(2265,plain,
( ~ ( sk2 @ sk5 )
| ~ ( sk1 @ sk6 )
| ( ( sk2 @ sk6 )
!= ( sk2 @ sk5 ) ) ),
inference(simp,[status(thm)],[2264]) ).
thf(3245,plain,
( ~ $true
| ~ ( sk1 @ sk6 )
| ~ ( sk2 @ sk6 ) ),
inference(rewrite,[status(thm)],[2265,3243]) ).
thf(3246,plain,
( ~ ( sk1 @ sk6 )
| ~ ( sk2 @ sk6 ) ),
inference(simp,[status(thm)],[3245]) ).
thf(28,plain,
( ~ ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 )
| ( sk2 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(bool_ext,[status(thm)],[16]) ).
thf(2254,plain,
( ~ $true
| ~ ( sk2 @ sk5 )
| ( sk2 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(rewrite,[status(thm)],[28,2246]) ).
thf(2255,plain,
( ~ ( sk2 @ sk5 )
| ( sk2 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(simp,[status(thm)],[2254]) ).
thf(3255,plain,
( ~ $true
| ( sk2 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(rewrite,[status(thm)],[2255,3243]) ).
thf(3256,plain,
( ( sk2 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(simp,[status(thm)],[3255]) ).
thf(3310,plain,
! [B: a,A: a] :
( ~ ( sk2 @ A )
| ( sk1 @ A )
| ( ( sk1 @ B )
!= ( sk1 @ sk6 ) )
| ( ( sk2 @ B )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[26,3254]) ).
thf(3311,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ( sk1 @ A )
| ( ( sk1 @ sk6 )
!= ( sk1 @ sk6 ) ) ),
inference(pattern_uni,[status(thm)],[3310:[bind(A,$thf( A )),bind(B,$thf( sk6 ))]]) ).
thf(3320,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ( sk1 @ A ) ),
inference(simp,[status(thm)],[3311]) ).
thf(3411,plain,
! [A: a] :
( ( sk1 @ sk6 )
| ( sk1 @ A )
| ( ( sk2 @ sk6 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[3256,3320]) ).
thf(3412,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[3411:[bind(A,$thf( sk6 ))]]) ).
thf(3413,plain,
sk1 @ sk6,
inference(simp,[status(thm)],[3412]) ).
thf(3416,plain,
( ~ $true
| ~ ( sk2 @ sk6 ) ),
inference(rewrite,[status(thm)],[3246,3413]) ).
thf(3417,plain,
~ ( sk2 @ sk6 ),
inference(simp,[status(thm)],[3416]) ).
thf(3475,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( ( sk2 @ A )
!= ( sk2 @ sk6 ) ) ),
inference(paramod_ordered,[status(thm)],[3321,3417]) ).
thf(3476,plain,
~ ( sk1 @ sk6 ),
inference(pattern_uni,[status(thm)],[3475:[bind(A,$thf( sk6 ))]]) ).
thf(3485,plain,
~ $true,
inference(rewrite,[status(thm)],[3476,3413]) ).
thf(3486,plain,
$false,
inference(simp,[status(thm)],[3485]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU856^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 15:46:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.96/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.14/1.02 % [INFO] Parsing done (148ms).
% 1.14/1.03 % [INFO] Running in sequential loop mode.
% 1.63/1.29 % [INFO] nitpick registered as external prover.
% 1.63/1.29 % [INFO] Scanning for conjecture ...
% 1.83/1.37 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.94/1.39 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.94/1.39 % [INFO] Problem is higher-order (TPTP THF).
% 1.94/1.39 % [INFO] Type checking passed.
% 1.94/1.39 % [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 ...
% 22.46/4.65 % [INFO] Killing All external provers ...
% 22.46/4.66 % Time passed: 4133ms (effective reasoning time: 3627ms)
% 22.46/4.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)>
% 22.46/4.67 % Axioms used in derivation (0):
% 22.46/4.67 % No. of inferences in proof: 86
% 22.46/4.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4133 ms resp. 3627 ms w/o parsing
% 22.71/4.87 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 22.71/4.87 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------